A complete deductive-system for since-until branching-time logic
Journal of Philosophical Logic 20 (2):131 - 148 (1991)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesGiacomo Bonanno (2001). Branching Time, Perfect Information Games and Backward Induction. Games and Economic Behavior 36 (1):57-73.
W. J. Blok & J. Rebagliato (2003). Algebraic Semantics for Deductive Systems. Studia Logica 74 (1-2):153 - 180.
Konstantinos Georgatos (1997). Knowledge on Treelike Spaces. Studia Logica 59 (2):271-301.
Alberto Zanardo (1992). A Note About the Axioms for Branching-Time Logic. Notre Dame Journal of Formal Logic 33 (2):225-228.
Mark Brown & Valentin Goranko (1999). An Extended Branching-Time Ockhamist Temporal Logic. Journal of Logic, Language and Information 8 (2):143-166.
Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4).
Alberto Zanardo (1998). Undivided and Indistinguishable Histories in Branching-Time Logics. Journal of Logic, Language and Information 7 (3):297-315.
Ron van der Meyden & Ka-shu Wong (2003). Complete Axiomatizations for Reasoning About Knowledge and Branching Time. Studia Logica 75 (1):93 - 123.
Alberto Zanardo (1990). Axiomatization of 'Peircean' Branching-Time Logic. Studia Logica 49 (2):183 - 195.
Roberto Ciuni & Alberto Zanardo (2010). Completeness of a Branching-Time Logic with Possible Choices. Studia Logica 96 (3):393-420.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads5 ( #160,239 of 549,010 )Recent downloads (6 months)1 ( #63,261 of 549,010 )How can I increase my downloads? |
My notes
Discussion
