The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
- 9 September 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Symbolically Computing Most-Precise Abstract Operations for Shape AnalysisLecture Notes in Computer Science, 2004
- Verification via Structure SimulationLecture Notes in Computer Science, 2004
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002
- Undecidability results on two-variable logicsArchive for Mathematical Logic, 1999
- Descriptive ComplexityPublished by Springer Science and Business Media LLC ,1999
- On the Decision Problem for Two-Variable First-Order LogicBulletin of Symbolic Logic, 1997
- Mona: Monadic second-order logic in practiceLecture Notes in Computer Science, 1995
- Weak monadic second order theory of succesor is not elementary-recursiveLecture Notes in Mathematics, 1975
- On languages with two variablesMathematical Logic Quarterly, 1975