Results 11 to 20 of about 1,161 (127)

Cut-elimination and Normalization Theorems for Connexive Logics over Wansing’s C

Bulletin of the Section of Logic
Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing’s basic constructive connexive logic C. The C-family is derived from C by incorporating Peirce’s law, the law of excluded middle, and the generalized law of excluded middle.
Norihiro Kamide
openalex   +3 more sources

A proof of cut-elimination theorem in simple type-theory [PDF]

Journal of the Mathematical Society of Japan, 1967
Moto-o Takahashi
openalex   +3 more sources

Completeness and cut-elimination theorems for trilattice logics

Annals of Pure and Applied Logic, 2011
The paper deals with Gentzen-type formulations of logics (see [\textit{S. P. Odintsov}, Stud. Log. 91, No.~3, 407--428 (2009; Zbl 1170.03014)]), related to the trilattice \(\mathit{SIXTEEN}_3\) (see [\textit{Y. Shramko} and \textit{H. Wansing}, J. Philos. Log. 34, No.~2, 121--153 (2005; Zbl 1094.03012)]). The authors present a sequent calculus \(L_{16}\
Norihiro Kamide, Heinrich Wansing
openalex   +2 more sources

Cut elimination theorem for second order arithmetic with the $\Pi_{1}^{1}$ -comprehension axiom and the $\omega$ -rule [PDF]

Journal of the Mathematical Society of Japan, 1970
Mariko Yasugi
openalex   +4 more sources

Cut-Elimination Theorem Concerning a Formal System for Ramified Theory of Types Which Admits Quantifications on Types

Annals of the Japan Association for Philosophy of Science, 1962
Sh ocirc ji MAEHARA
openalex   +3 more sources

Satoko Titani. An algebraic formulation of cut-elimination theorem. Journal of the Mathematical Society of Japan, vol. 17 (1965), pp. 72–83. [PDF]

The Journal of Symbolic Logic, 1970
Moto-o Takahashi
  +4 more sources

Cut Elimination for Extended Sequent Calculi

Bulletin of the Section of Logic, 2023
We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini, Andrea Masini, Margherita Zorzi   +2 more
doaj   +1 more source

One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity

Bulletin of the Section of Logic, 2021
Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj   +1 more source

Cut-elimination theorems for some logics associated with double Stone algebras

International Journal of Approximate Reasoning
Martín Figallo, Juan Sebastián Slagter
openalex   +2 more sources

Herbrand-Confluence [PDF]

Logical Methods in Computer Science, 2013
We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing.
Stefan Hetzl, Lutz Straßburger
doaj   +1 more source