Strong Cut-Elimination for Constant Domain First-Order S5

Logic Journal of the IGPL 3 (5):797-810 (1995)
  Copy   BIBTEX

Abstract

We consider a labelled tableau presentation of constant domain first-order S5 and prove a strong cut-elimination theorem.

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Tautology Elimination, Cut Elimination, and S5.Andrezj Indrzejczak - 2017 - Logic and Logical Philosophy 26 (4):461-471.
A Cut-free Gentzen Formulation Of The Modal Logic S5.T. Braüner - 2000 - Logic Journal of the IGPL 8 (5):629-643.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
Strong Cut-elimination In Display Logic.Heinrich Wansing - 1995 - Reports on Mathematical Logic:117-131.
Cut and gamma I: Propositional and constant domain R.Yale Weiss - 2020 - Review of Symbolic Logic 13 (4):887-909.
A note on an alternative Gentzenization of RW+∘.Mirjana Ilić - 2021 - Mathematical Logic Quarterly 67 (2):186-192.

Analytics

Added to PP
2015-02-04

Downloads
10 (#1,204,939)

6 months
4 (#1,004,663)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Heinrich Wansing
Ruhr-Universität Bochum

Citations of this work

Natural deduction calculi for classical and intuitionistic S5.S. Guerrini, A. Masini & M. Zorzi - 2023 - Journal of Applied Non-Classical Logics 33 (2):165-205.
Cut-free sequent calculus for S5.Andrzej Indrzejczak - 1996 - Bulletin of the Section of Logic 25 (2):95-102.

Add more citations

References found in this work

No references found.

Add more references