An axiomatization for until and since over the reals without the IRR rule
Studia Logica 51 (2):165 - 193 (1992)
| Abstract | We give a Hilbert style axiomatization for the set of formulas in the temporal language with Until and Since which are valid over the real number flow of time. The axiomatization, which is orthodox in the sense of only having the usual temporal rules of inference, is complete with respect to single formulas. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAlberto Zanardo (1985). A Finite Axiomatization of the Set of Strongly Valid Ockhamist Formulas. Journal of Philosophical Logic 14 (4):447 - 468.
Mark Reynolds (1994). Axiomatisation and Decidability Off Andp in Cyclical Time. Journal of Philosophical Logic 23 (2):197 - 224.
Martin Peterson & Sven Ove Hansson (2005). Order-Independent Transformative Decision Rules. Synthese 147 (2):323-342.
Renata P. De Freitas, Jorge P. Viana, Mario R. F. Benevides, Sheila R. M. Veloso & Paulo A. S. Veloso (2003). Squares in Fork Arrow Logic. Journal of Philosophical Logic 32 (4):343 - 355.
Philippe Balbiani, Andreas Herzig & Nicolas Troquard (2008). Alternative Axiomatics and Complexity of Deliberative Stit Theories. Journal of Philosophical Logic 37 (4).
Renata P. de Freitas, Jorge P. Viana, Mario R. F. Benevides, Sheila R. M. Veloso & Paulo A. S. Veloso (2003). Squares in Fork Arrow Logic. Journal of Philosophical Logic 32 (4):343-355.
Alberto Zanardo (1990). Axiomatization of 'Peircean' Branching-Time Logic. Studia Logica 49 (2):183 - 195.
Lennart Åqvist (1996). Discrete Tense Logic with Infinitary Inference Rules and Systematic Frame Constants: A Hilbert-Style Axiomatization. Journal of Philosophical Logic 25 (1):45 - 100.
Maria Concetta Di Maio & Alberto Zanardo (1998). A Gabbay-Rule Free Axiomatization of T X W Validity. Journal of Philosophical Logic 27 (5):435 - 487.
M. Reynolds (2001). An Axiomatization of Full Computation Tree Logic. Journal of Symbolic Logic 66 (3):1011-1057.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #203,804 of 556,807 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
