Results 221 to 230 of about 4,006 (251)

Cut-Elimination Theorem for the Logic of Constant Domains

Mathematical Logic Quarterly, 1994
AbstractThe logic CD is an intermediate logic (stronger than intuitionistic logic and weaker than classical logic) which exactly corresponds to the Kripke models with constant domains. It is known that the logic CD has a Gentzen‐type formulation called LD (which is same as LK except that (→) and (⊃–) rules are replaced by the corresponding ...
Tatsuya Shimura, Ryo Kashima
exaly   +3 more sources

Gentzen’s Cut Elimination Theorem for Non-Logicians

Tulane Studies in Philosophy, 1972
The most important theorem of constructive mathematical logic, Gentzen’s cut elimination theorem, is largely unknown even among those acquainted with mathematical logic. Usual treatments of mathematical logic, oriented to semantics, use formalization only to find a syntactic property (theoremhood) to correspond to the semantic property (validity). What
exaly   +2 more sources

Outline of the cut-elimination theorem

2021
Paolo Mancosu, Sérgio Galvan, Richard Zach   +2 more
exaly   +2 more sources

A cut-elimination theorem

Lecture Notes in Mathematics, 1972
G M Kelly, Kelly G M
exaly   +2 more sources

Cut-elimination theorem for relevant logics

Journal of Soviet Mathematics, 1976
G E Mints, Mints G E
exaly   +3 more sources

Semantic Cut Elimination in the Intuitionistic Sequent Calculus

Lecture Notes in Computer Science, 2005
. Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies on completeness of the cutfree calculus with respect to Kripke Models. The
Olivier Hermant
exaly   +2 more sources

Algebraic Aspects of Cut Elimination [PDF]

Studia Logica, 2004
We will give here a purely algebraic proof of the cut elimination theorem for various sequent systems. Our basic idea is to introduce mathematical structures, called Gentzen structures, for a given sequent system without cut, and then to show the ...
Francesco Belardinelli, Peter Jipsen, Hiroakira Ono   +2 more
exaly   +2 more sources

Interpolants, cut elimination and flow graphs for the propositional calculus

Annals of Pure and Applied Logic, 1997
We analyse the structure of propositional proofs in the sequent calculus focusing on the well-known procedures of Interpolation and Cut Elimination. We are motivated in part by the desire to understand why a tautology might be ‘hard to prove’.
Alessandra Carbone
exaly   +2 more sources

Strongly Normalising Cut-Elimination with Strict Intersection Types

Electronic Notes in Theoretical Computer Science, 2003
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for this reduction.
Steffen Van Bakel
exaly   +2 more sources

Cut-elimination Theorems for Some Infinitary Modal Logics

MLQ, 2001
The well-known Gentzen systems of propositional modal logics K, T, K4, and S4 are extended naturally to their infinitary versions by adjoining the rules for (countably) infinite conjunction and disjunction preserving the cut-elimination property, according to which then the infinitary formula corresponding to the so-called Barcan axiom of predicate ...
openaire   +2 more sources