Results 21 to 30 of about 118,600 (325)
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 +2 more
doaj +1 more source
An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets [PDF]
Logical Methods in Computer Science, 2021 We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this constraint and ...
Jules Chouquet, Lionel Vaux Auclair
doaj +1 more source
Simplified cut elimination for Kripke-Platek set theory [PDF]
, 2022 The purpose of this article is to present a new and simplified cut elimination procedure for KP. We start off from the basic language of set theory and add constants for all elements of the constructible hierarchy up to the Bachmann-Howard ordinal ψ(εΩ+1)
Jäger, Gerhard
core +1 more source
Cut-Free Gentzen Sequent Calculi for Tense Logics
Axioms, 2023 The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic Kt is introduced. This sequent calculus satisfies the displaying property.
Zhe Lin, Minghui Ma
doaj +1 more source
Generating facets for the cut polytope of a graph by triangular elimination [PDF]
Mathematical Programming, 2006 Tsuyoshi Itô +2 more
exaly +2 more sources
The Role of Quantifier Alternations in Cut Elimination [PDF]
Notre Dame Journal of Formal Logic, 2003 Extending previous results from the author's master's thesis, subsequently published in the proceedings of CSL 2003, on the complexity of cut elimination for the sequent calculus LK, we discuss the role of quantifier alternations and develop a measure to describe the complexity of cut elimination in terms of quantifier alternations in cut formulas and ...
Gerhardy, Philipp
openaire +6 more sources
The Structure of Differential Invariants and Differential Cut Elimination [PDF]
Logical Methods in Computer Science, 2012 The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-form solutions only exist for very simple differential equations, proof certificates have been proposed for more scalable ...
Andre Platzer
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
IMELL Cut Elimination with Linear Overhead [PDF]
Recently, Accattoli introduced the Exponential Substitution Calculus (ESC) given by untyped proof terms for Intuitionistic Multiplicative Exponential Linear Logic (IMELL), endowed with rewriting rules at-a-distance for cut elimination. He also introduced
Beniamino Accattoli +1 more
core +7 more sources
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
Logical Methods in Computer Science, 2018 The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Revantha Ramanayake
doaj +1 more source