Results 1 to 10 of about 2,879,335 (195)
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 +5 more sources
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +4 more sources
Cut-elimination for the mu-calculus with one variable [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We establish syntactic cut-elimination for the one-variable fragment of the modal mu-calculus. Our method is based on a recent cut-elimination technique by Mints that makes use of Buchholz' Omega-rule.
Grigori Mints, Thomas Studer
doaj +10 more sources
Fast Cut-Elimination using Proof Terms: An Empirical Study [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Gabriel Ebner
doaj +6 more sources
Schematic Cut Elimination and the Ordered Pigeonhole Principle [PDF]
International Joint Conference on Automated Reasoning, 2016 In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of {\Pi} 2 cuts (a recursive proof encapsulating the infinitary pigeonhole principle) [5].
David M. Cerna, A. Leitsch
semanticscholar +4 more sources
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions [PDF]
Journal of Logic and Computation, 2021 A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with inductive definitions
Yukihiro Oda +2 more
semanticscholar +2 more sources
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 +3 more sources
Cut elimination for Zermelo set theory [PDF]
arXiv.org, 2023 We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase set theory as
Gilles Dowek, Alexandre Miquel
semanticscholar +2 more sources
A new calculus for intuitionistic Strong Löb logic: strong termination and cut-elimination, formalised [PDF]
International Conference on Theorem Proving with Analytic Tableaux and Related Methods, 2023 We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating backward proof search for the intuitionistic Strong L\"ob logic $\sf{iSL}$, an intuitionistic modal logic with a provability interpretation.
Ian Shillito +3 more
semanticscholar +3 more sources
Cut elimination for knowledge logic with interaction
Lietuvos Matematikos Rinkinys, 2021 In the article the multimodal logic Tn with central agent interaction axiom is analysed. The Hilbert type calculi is presented, then Gentzen type calculi with cut is derived and the proof of cutelimination theorem is outlined.
Julius Andrikonis +1 more
doaj +3 more sources