Abstract
We prove decidability of satisfiability of sentences of the monodic packed fragment of first-order temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. We also prove decidability over models with finite domains, over flows of time including the real order.
Similar content being viewed by others
References
BÜchi, J. R., 'On a decision method in restricted second order arithmetic', pp. 1-11 in Logic, Methodology, and Philosophy of Science: Proc. 1960 Internat. Congress, Stanford University Press, 1962.
Degtyarev, A., M. Fisher, and A. Lisitsa, 'Equality and monodic first-order temporal logic', Studia Logica (this volume).
GrÄdel, E., 'Decision procedures for guarded logics', pp. 31-51 in Automated Deduction — CADE16, Lecture Notes in Computer Sscience 1632, Springer-Verlag, 1999.
Hodkinson, I., 'Loosely guarded fragment of first-order logic has the finite model property', Studia Logica 70:205-240, 2002.
Hodkinson, I., and M. Otto, 'Finite conformal hypergraph covers and Gaifman cliques in finite structures', preprint, 2001. See http://www-compsci.swan.ac.uk/~csmartin/papers/HO.ps
Hodkinson, I., F. Wolter, and M. Zakharyaschev, 'Decidable fragments of first-order temporal logics', Annals of Pure and Applied Logic 106:85-134, 2000.
Marx, M., 'Tolerance logic', Journal of Logic, Language and Computation 10:353-373, 2001.
Rabin, M. O., 'Decidability of second order theories and automata on infinite trees', Trans. Amer. Math. Soc. 141:1-35, 1969.
Wolter, F., and M. Zakharyaschev, 'Axiomatizing the monodic fragment of first-order temporal logic', Annals of Pure and Applied Logic 118:133-145, 2002.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hodkinson, I. Monodic Packed Fragment with Equality is Decidable. Studia Logica 72, 185–197 (2002). https://doi.org/10.1023/A:1021356410579
Issue Date:
DOI: https://doi.org/10.1023/A:1021356410579