A Simple Proof of Completeness and Cut-elimination for Propositional G¨ odel Logic
|Abstract||We provide a constructive, direct, and simple proof of the completeness of the cut-free part of the hypersequential calculus for G¨odel logic (thereby proving both completeness of the calculus for its standard semantics, and the admissibility of the cut rule in the full calculus). We then extend the results and proofs to derivations from assumptions, showing that such derivations can be conﬁned to those in which cuts are made only on formulas which occur in the assumptions|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Norihiro Kamide (2009). Proof Systems Combining Classical and Paraconsistent Negations. Studia Logica 91 (2):217 - 238.
Francesco Belardinelli, Peter Jipsen & Hiroakira Ono (2004). Algebraic Aspects of Cut Elimination. Studia Logica 77 (2):209 - 240.
Grigori Mints (2012). Effective Cut-Elimination for a Fragment of Modal Mu-Calculus. Studia Logica 100 (1-2):279-287.
Gilles Dowek & Benjamin Werner (2003). Proof Normalization Modulo. Journal of Symbolic Logic 68 (4):1289-1316.
Branislav R. Boričić (1986). A Cut-Free Gentzen-Type System for the Logic of the Weak Law of Excluded Middle. Studia Logica 45 (1):39 - 53.
G. Mints (1999). Cut-Elimination for Simple Type Theory with an Axiom of Choice. Journal of Symbolic Logic 64 (2):479-485.
Linda Postniece, Combining Derivations and Refutations for Cut-Free Completeness in Bi-Intuitionistic Logic.
Roy Dyckhoff & Luis Pinto (1998). Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica 60 (1):107-118.
Added to index2009-01-28
Total downloads8 ( #131,679 of 722,813 )
Recent downloads (6 months)2 ( #36,644 of 722,813 )
How can I increase my downloads?