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.

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/3.5.797

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

External links

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

Through your library

My notes

Similar books and articles

Cut‐Elimination Theorem for the Logic of Constant Domains.Ryo Kashima & Tatsuya Shimura - 1994 - Mathematical Logic Quarterly 40 (2):153-172.
Strong Cut-elimination In Display Logic.Heinrich Wansing - 1995 - Reports on Mathematical Logic:117-131.
Partly Free Semantics for Some Anderson-Like Ontological Proofs.Mirosław Szatkowski - 2011 - Journal of Logic, Language and Information 20 (4):475-512.
Cognitive components of troubleshooting strategies.Leo Gugerty - 2007 - Thinking and Reasoning 13 (2):134 – 163.
Vyčerpávající aktuální entity všechny možné objekty?Radim Bělohrad - 2002 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 9 (4):359-384.
Completeness and cut-elimination theorems for trilattice logics.Norihiro Kamide & Heinrich Wansing - 2011 - Annals of Pure and Applied Logic 162 (10):816-835.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
Cut-elimination in second order logic.O. Serebriannikov - 1988 - Bulletin of the Section of Logic 17 (3-4):159-160.
A Model Theoretical Generalization of Steinitz’s Theorem.Alexandre Martins Rodrigues & Edelcio De Souza - 2011 - Principia: An International Journal of Epistemology 15 (1):107-110.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
Do we need second-order probabilities?Sven Ove Hansson - 2008 - Dialectica 62 (4):525-533.
Some Factors Determining the Order of Elimination of Culs-de-sac in the Maze.C. J. Warden - 1923 - Journal of Experimental Psychology 6 (3):192.
A note on the proof theory the λII-calculus.David J. Pym - 1995 - Studia Logica 54 (2):199 - 230.
Classical harmony: Rules of inference and the meaning of the logical constants.Peter Milne - 1994 - Synthese 100 (1):49 - 94.
Weak forms of elimination of imaginaries.Enrique Casanovas & Rafel Farré - 2004 - Mathematical Logic Quarterly 50 (2):126-140.

Analytics

Added to PP
2015-02-04

Downloads
10 (#1,200,215)

6 months
4 (#798,692)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Heinrich Wansing
Ruhr-Universität Bochum

Citations of this work

Cut-free sequent calculus for S5.Andrzej Indrzejczak - 1996 - Bulletin of the Section of Logic 25 (2):95-102.
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.

Add more citations

References found in this work

No references found.

Add more references