Axiomatizing the monodic fragment of first-order temporal logic

Abstract It is known that even seemingly small fragments of the first-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic (not monadic, where this result does not hold) fragment is an exception by constructing its finite Hilbert-style axiomatization. We also show that the monodic fragment with equality is not recursively axiomatizable.

[1]  Frank Wolter,et al.  Decidable fragment of first-order temporal logics , 2000, Ann. Pure Appl. Log..

[2]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[3]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[4]  Jan Chomicki,et al.  Temporal Logic in Information Systems , 1998, Logics for Databases and Information Systems.

[5]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

[6]  Jan Chomicki,et al.  On the Feasibility of Checking Temporal Integrity Constraints , 1995, J. Comput. Syst. Sci..

[7]  William C. Purdy.  Fluted Formulas and the Limits of Decidability , 1996, J. Symb. Log..

[8]  Gunter Saake,et al.  Logics for databases and information systems , 1998 .

[9]  Ian M. Hodkinson,et al.  Loosely Guarded Fragment of First-Order Logic has the Finite Model Property , 2002, Stud Logica.

[10]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[11]  J. Benthem.  DYNAMIC BITS AND PIECES , 1997 .

[12]  D. Peled,et al.  Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1 , 1995 .

[13]  F. Wolter,et al.  Fragments of first-order temporal logics , 2000 .

[14]  William C. Purdy.  Decidability of Fluted Logic with Identity , 1996, Notre Dame J. Formal Log..

[15]  Erich Grädel,et al.  Decision procedures for guarded logics , 1999 .