Results 91 to 100 of about 268 (109)
Algebraic proofs of cut elimination
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive.
Jeremy Avigad
exaly +2 more sources
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen\u27s proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed.
Roy, Sayantan
exaly +2 more sources
Some of the next articles are maybe not open access.
A note on cut-elimination for classical propositional logic
Archive for Mathematical Logic, 2021Gabriele Pulcini
exaly
Cut-elimination Theorems for Some Infinitary Modal Logics
Mathematical Logic Quarterly, 2001Yoshihito Tanaka
exaly
Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic
Studia Logica, 2019Norihiro Kamide +2 more
exaly
Completeness and cut-elimination theorems for trilattice logics
Annals of Pure and Applied Logic, 2011Norihiro Kamide, Heinrich Wansing
exaly
A Simple Proof that Super-Consistency Implies Cut Elimination
Notre Dame Journal of Formal Logic, 2012Gilles Dowek, Olivier Hermant
exaly
Interpolants, cut elimination and flow graphs for the propositional calculus
Annals of Pure and Applied Logic, 1997Alessandra Carbone
exaly

