Results 41 to 50 of about 5,524 (273)
Unified Sequent Calculi and Natural Deduction Systems for Until-free Linear-time Temporal Logics
Bulletin of the Section of LogicA unified Gentzen-style proof-theoretic framework for until-free propositional linear-time temporal logic and its intuitionistic variant is introduced.
Norihiro Kamide, Sara Negri
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
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
Proof Theory of Finite-valued Logics [PDF]
, 1993 The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux
Zach, Richard
core +5 more sources
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
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
Theories of truth based on four-valued infectious logics [PDF]
, 2020 Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth.
Da Re, Bruno +2 more
core
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An international Delphi panel of experts developed consensus statements to delineate the circumstances where the risks of dexamethasone as an antiemetic do and do not outweigh its benefits. Procedure Experts in supportive care of pediatric patients were invited to participate.
Negar Shavandi +20 more
wiley +1 more source