Results 31 to 40 of about 118,600 (325)
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
Cut-elimination, substitution and normalisation [PDF]
, 2014 Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version, checked with the Isabelle proof assistant) that, for a G3-style calculus covering all of intuitionistic zero-order logic, with an associated term ...
Roy Dyckhoff, Dyckhoff, Roy
core +1 more source
Cut elimination by unthreading
Archive for Mathematical Logic, 2023 AbstractWe provide a non-Gentzen, though fully syntactical, cut-elimination algorithm for classical propositional logic. The designed procedure is implemented on $$\textsf{GS4}$$ GS 4 , the one-sided version of Kleene’s sequent system $$\textsf{G4}$$
openaire +4 more sources
Algebraic Aspects of Cut Elimination [PDF]
Studia Logica, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Belardinelli +2 more
openaire +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 sequent calculus for logic S5n(ED)
Lietuvos Matematikos Rinkinys, 2010 Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are considered in this paper. Gentzen style sequent calculus is constructed and its equivalence with Hilbert style system is proved, getting soundness and ...
Haroldas Giedra
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
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
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