Results 41 to 50 of about 5,727 (317)
Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations
Bulletin of the Section of Logic, 2020 We continue the investigation of the first paper where we studied logics with various negations including empirical negation and co-negation. We established how such logics can be treated uniformly with R. Sylvan's CCω as the basis.
Satoru Niki
doaj +1 more source
Certification of Prefixed Tableau Proofs for Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented.
Tomer Libal, Marco Volpe
doaj +1 more source
Realisability semantics of abstract focussing, formalised [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present a sequent calculus for abstract focussing, equipped with proof-terms: in the tradition of Zeilberger's work, logical connectives and their introduction rules are left as a parameter of the system, which collapses the synchronous and ...
Stéphane Graham-Lengrand
doaj +1 more source
Towards a Proof Theory of G\"odel Modal Logics [PDF]
, 2011 Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
A. Avron +23 more
core +1 more source
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi [PDF]
Logical Methods in Computer Science, 2009 The intuitionistic fragment of the call-by-name version of Curien and Herbelin's \lambda\_mu\_{\~mu}-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed lambda-calculus.
Jose Espirito Santo +2 more
doaj +1 more source
Elimination of Cuts in First-order Finite-valued Logics [PDF]
, 1993 A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established.
Baaz, Matthias +2 more
core +4 more sources
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
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
Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics [PDF]
, 2019 This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics.
A Ciabattoni +15 more
core +2 more sources
Lietuvos Matematikos Rinkinys, 2013 We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”. The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis +1 more
doaj +1 more source