Linear Time Algorithms and NP-Complete Problems
SIAM Journal on Computing
The quantifier structure of sentences that characterize nondeterministic time complexity
Computational Complexity
Invariance properties of RAMs and linear time
Computational Complexity
Languages, automata, and logic
Handbook of formal languages, vol. 3
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
A restricted second order logic for finite structures
Information and Computation
Monadic logical definability of nondeterministic linear time
Computational Complexity
Locality of order-invariant first-order formulas
ACM Transactions on Computational Logic (TOCL)
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Nonerasing, counting, and majority over the linear time hierarchy
Information and Computation
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
SIAM Journal on Computing
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Descriptive Complexity, Lower Bounds and Linear Time
Proceedings of the 12th International Workshop on Computer Science Logic
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
Successor-Invariance in the Finite
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Arithmetic, first-order logic, and counting quantifiers
ACM Transactions on Computational Logic (TOCL)
Extensions of MSO and the monadic counting hierarchy
Information and Computation
| Hi-index | 0.00 |
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper, we take a closer look at the expressive power of MLFP. Our results are: (1) MLFP can describe graph properties beyond any fixed level of the monadic second-order quantifier alternation hierarchy. (2) On strings with built-in addition, MLFP can describe at least all languages that belong to the linear time complexity class DLIN. (3) Settling the question whether addition-invariant MLFP = addition-invariant MSO on finite strings or, equivalently, settling the question whether MLFP = MSO on finite strings with addition would solve open problems in complexity theory: "=" would imply that PH = PTIME whereas "≠" would imply that DLIN ≠ LINH. Apart from this we give a self-contained proof of the previously known result that MLFP is strictly less expressive than MSO on the class of finite graphs.