David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 76 (1):91 - 134 (2004)
As a remedy for the bad computational behaviour of first-order temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining so-called monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of first-order logic like the two-variable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for first-order fragments can be used for constructing a tableau algorithm for the corresponding monodic fragment of FOTL. Some example instantiations of the framework are presented.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Clare Dixon, Cláudia Nalon & Michael Fisher (2004). Tableaux for Logics of Time and Knowledge with Interactions Relating to Synchrony. Journal of Applied Non-Classical Logics 14 (4):397-445.
David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev (2006). Non-Primitive Recursive Decidability of Products of Modal Logics with Expanding Domains. Annals of Pure and Applied Logic 142 (1):245-268.
Similar books and articles
Natasha Alechina (1995). On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic. Journal of Logic, Language and Information 4 (3):177-189.
Eva Hoogland & Maarten Marx (2002). Interpolation and Definability in Guarded Fragments. Studia Logica 70 (3):373 - 409.
Erich Grädel (1999). On the Restraining Power of Guards. Journal of Symbolic Logic 64 (4):1719-1742.
Frank Wolter & Michael Zakharyaschev (2001). Decidable Fragments of First-Order Modal Logics. Journal of Symbolic Logic 66 (3):1415-1438.
Walter Hussak (2008). Decidable Cases of First-Order Temporal Logic with Functions. Studia Logica 88 (2):247 - 261.
Roman Kontchakov, Agi Kurucz & Michael Zakharyaschev (2005). Undecidability of First-Order Intuitionistic and Modal Logics with Two Variables. Bulletin of Symbolic Logic 11 (3):428-438.
Savas Konur (2011). An Event-Based Fragment of First-Order Logic Over Intervals. Journal of Logic, Language and Information 20 (1):49-68.
Ian Hodkinson (2002). Monodic Packed Fragment with Equality is Decidable. Studia Logica 72 (2):185-197.
Anatoli Degtyarev, Michael Fisher & Alexei Lisitsa (2002). Equality and Monodic First-Order Temporal Logic. Studia Logica 72 (2):147-156.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads2 ( #385,620 of 1,413,298 )
Recent downloads (6 months)1 ( #154,925 of 1,413,298 )
How can I increase my downloads?