Dec 28, 2012 · We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space.

We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space.

Mar 13, 2013 · Our main results are that LREC captures LOGSPACE on the class of directed trees and that LREC= captures LOGSPACE on the class of interval graphs ...

We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic ...

This work extends first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in ...

L-Recursion and a new Logic for Logarithmic Space. Grohe, Martin; Grussien, Berit; Hernich, Andre; Laubner, Bastian. (2012, 2013) Preprint. Institutions.

Martin Grohe , Berit Grußien, André Hernich, Bastian Laubner: L-Recursion and a new Logic for Logarithmic Space. Log. Methods Comput. Sci. 9(1) (2012).

L-Recursion and a new Logic for Logarithmic Space. Grohe, Martin; Grussien, Berit; Hernich, Andre; Laubner, Bastian.

We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic ...

We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space.