Cut-free sequent calculi for some tense logics
Studia Logica 53 (1):119 - 135 (1994)
| Abstract | We introduce certain enhanced systems of sequent calculi for tense logics, and prove their completeness with respect to Kripke-type semantics. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
|
| Through your library | Configure |
Kentaro Kikuchi & Ryo Kashima (2001). Sequent Calculi for Visser's Propositional Logics. Notre Dame Journal of Formal Logic 42 (1):1-22.
Norihiro Kamide (2005). Gentzen-Type Methods for Bilattice Negation. Studia Logica 80 (2-3):265 - 289.
Sara Negri (2005). Proof Analysis in Modal Logic. Journal of Philosophical Logic 34 (5-6):507 - 544.
René Lavendhomme & Thierry Lucas (2000). Sequent Calculi and Decision Procedures for Weak Modal Systems. Studia Logica 66 (1):121-145.
A. Avron & B. Konikowska (2008). Rough Sets and 3-Valued Logics. Studia Logica 90 (1):69 - 92.
Stéphane Demri & Rajeev Goré (2000). Display Calculi for Logics with Relative Accessibility Relations. Journal of Logic, Language and Information 9 (2):213-236.
Mauro Ferrari (1997). Cut-Free Tableau Calculi for Some Intuitionistic Modal Logics. Studia Logica 59 (3):303-330.
Alexej P. Pynko (2009). Distributive-Lattice Semantics of Sequent Calculi with Structural Rules. Logica Universalis 3 (1).
Martin Amerbauer (1996). Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics. Studia Logica 57 (2-3):359 - 372.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads3 ( #201,930 of 549,087 )Recent downloads (6 months)0How can I increase my downloads? |

