Results 31 to 40 of about 25,817 (283)
Sequent Calculi for Visser's Propositional Logics
Notre Dame Journal of Formal Logic, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsumasa Ishii +2 more
openaire +2 more sources
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas.
Federico Aschieri
doaj +1 more source
Sequent calculus for logic of correlated knowledge
Lietuvos Matematikos Rinkinys, 2011 Sound and complete sequent calculi for general epistemic logic and logic of correlated knowledge are presented in this paper.
Haroldas Giedra +1 more
doaj +1 more source
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
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
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
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
Cut-elimination and Normalization Theorems for Connexive Logics over Wansing’s C
Bulletin of the Section of LogicGentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing’s basic constructive connexive logic C.
Norihiro Kamide
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