LREC= is an extension of first-order logic with a logarithmic recursion operator . It was introduced by Grohe et al. and shown to capture complexityclass L over trees and interval graphs . It does not capture L in general as it is contained in FPC – fixed-point logic with counting . We show that this containment is strict. In particular, we show that the path systems problem, aclassic P-complete problem which is definable in LFP – fixed point logic – is not definable .

Author(s) : Anuj Dawar, Felipe Ferreira Santos

Links : PDF - Abstract

Code :
Coursera

Keywords : logic - lrec - capture - lfp - definable -

Leave a Reply

Your email address will not be published. Required fields are marked *