The complexity of first-order and monadic second-order logic revisited
Top Cited Papers
- 1 December 2004
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 130 (1-3), 3-31
- https://doi.org/10.1016/j.apal.2004.01.007
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Deciding first-order properties of locally tree-decomposable structuresJournal of the ACM, 2001
- Logics with counting and local propertiesACM Transactions on Computational Logic, 2000
- Parameterized circuit complexity and the W hierarchyTheoretical Computer Science, 1998
- Linear time computable problems and first-order descriptionsMathematical Structures in Computer Science, 1996
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960