Results 41 to 50 of about 1,740 (284)
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
Uniform interpolation and sequent calculi in modal logic [PDF]
, 2019 A method is presented that connects the existence of uniform interpolants to the existence of certain sequent calculi. This method is applied to several modal logics and is shown to cover known results from the literature, such as the existence of ...
Iemhoff, R. +2 more
core +3 more sources
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
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
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
Sequent calculi for nominal tense logics: a step towards mechanization [PDF]
, 1999 . We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π 0 1-formulae and Π 0 2-formulae. The calculi are based on d’Agostino and Mondadori’s calculus KE and therefore
Stéphane Demri, Demri, Stéphane
core +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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives The association between exposure to dinutuximab beta (DB) and event‐free survival (EFS) or overall survival (OS) of neuroblastoma patients was assessed using data collected during three clinical trials (five cohorts). Methods A systematic review (March 2026) was conducted to identify relevant studies (prospective; registered DB ...
Przemysław Holko +19 more
wiley +1 more source
On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics [PDF]
, 2010 In this thesis we examine the relationship between hypersequent and some types of labelled sequent calculi for a subset of intermediate logics—logics between intuitionistic (Int), and classical logics—that have geometric Kripke semantics, which we call ...
Rothenberg, Robert
core