Results 31 to 40 of about 2,682,535 (254)
Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics [PDF]
Studia Logica: An International Journal for Symbolic Logic, 2017 We develop a Gentzen-style proof theory for super-Belnap logics (extensions of the four-valued Dunn–Belnap logic), expanding on an approach initiated by Pynko.
Adam Přenosil
semanticscholar +1 more source
Schema Complexity in Propositional-Based Logics
Mathematics, 2021 The essential structure of derivations is used as a tool for measuring the complexity of schema consequences in propositional-based logics. Our schema derivations allow the use of schema lemmas and this is reflected on the schema complexity.
Jaime Ramos +2 more
doaj +1 more source
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae [PDF]
Logical Methods in Computer Science, 2016 Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent calculus and a ...
Paola Bruscoli +3 more
doaj +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
Cut-elimination for knowledge logics with interaction
Lietuvos Matematikos Rinkinys, 2008 In the article, multimodal logics K4n and S4n with the central agent axiom are analysed. The Hilbert type calculi are presented, then the Gentzen type calculi with cut are derived, and the proofs of the cut-eliminationtheorems are outlined.
Julius Andrikonis
doaj +1 more source
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities [PDF]
Journal of Logic and Computation, 2016 The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called ‘Lambek’s restriction’, i.e. the antecedent of any provable sequent should be non-
M. Kanovich, S. Kuznetsov, A. Scedrov
semanticscholar +1 more source
Cut-Simulation and Impredicativity [PDF]
Logical Methods in Computer Science, 2009 We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for classical type ...
Christoph Benzmueller +2 more
doaj +1 more source
Reverse mathematics and well-ordering principles [PDF]
, 2011 The paper is concerned with generally Pi^1_2 sentences of the form 'if X is well ordered then f(X) is well ordered', where f is a standard proof theoretic function from ordinals to ordinals.
Rathjen, Michael, Weiermann, Andreas
core +1 more source
Confluence for classical logic through the distinction between values and computations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We apply an idea originated in the theory of programming languages - monadic meta-language with a distinction between values and computations - in the design of a calculus of cut-elimination for classical logic.
José Espírito Santo +3 more
doaj +1 more source
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