%0 Journal Article
%J Theoretical Computer Science
%D 2015
%T Applicative theories for logarithmic complexity classes
%A Sebastian Eberhard
%X We present applicative theories of words corresponding to weak, and especially logarithmic, complexity classes. The theories for the logarithmic hierarchy and alternating logarithmic time formalise function algebras with concatenation recursion as main principle. We present two theories for logarithmic space where the first formalises a new two-sorted algebra which is very similar to Cook and Bellantoni's famous two-sorted algebra B for polynomial time [4]. The second theory describes logarithmic space by formalising concatenation- and sharply bounded recursion. All theories contain the predicates WW representing words, and VV representing temporary inaccessible words. They are inspired by Cantini's theories [6] formalising B.
%B Theoretical Computer Science
%I Elsevier
%V 585
%P 115-135
%8 June
%G eng
%U http://www.iam.unibe.ch/ltgpub/2015/ebat15.pdf