Cut-free Systems For The Modal Logic S4.3 And S4.3grz

Reports on Mathematical Logic (1991)
  Copy   BIBTEX

Abstract

We will define cut-free Gentzen-style systems for the modal propositional logics $S4.3 \vee \square)$ and $S4.3Grz \supset A)\supset A)$, and give a syntactical proof of the cut-elimination theorem. As its application, we will give a syntactical proof of the McKinsey-Tarski correspondence between $S_\omega$ and S4.3 and its extension.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Cut-elimination Theorems of Some Infinitary Modal Logics.Yoshihito Tanaka - 2001 - Mathematical Logic Quarterly 47 (3):327-340.
Some proof systems for common knowledge predicate.Yoshihito Tanaka - 2003 - Reports on Mathematical Logic:79-100.
Cut Elimination for Extended Sequent Calculi.Simone Martini, Andrea Masini & Margherita Zorzi - 2023 - Bulletin of the Section of Logic 52 (4):459-495.
A Cut-free Gentzen Formulation Of The Modal Logic S5.T. Braüner - 2000 - Logic Journal of the IGPL 8 (5):629-643.
Complete infinitary type logics.J. W. Degen - 1999 - Studia Logica 63 (1):85-119.
Extension without cut.Lutz Straßburger - 2012 - Annals of Pure and Applied Logic 163 (12):1995-2007.

Analytics

Added to PP
2015-02-12

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

References found in this work

No references found.

Add more references