Results 1 to 10 of about 165,353 (118)
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
Logical Methods in Computer Science, 2018 The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Revantha Ramanayake
doaj +3 more sources
On noncommutative extensions of linear logic [PDF]
Logical Methods in Computer Science, 2019 Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus.
Sergey Slavnov
doaj +3 more sources
Uniform Proofs of Normalisation and Approximation for Intersection Types [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method.
Kentaro Kikuchi
doaj +4 more sources
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 +2 more sources
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj +2 more sources
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems [PDF]
Logical Methods in Computer Science, 2011 Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining
Stéphane Jean Eric Lengrand +2 more
doaj +2 more sources
Cut-Free Gentzen Sequent Calculi for Tense Logics
Axioms, 2023 The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic Kt is introduced. This sequent calculus satisfies the displaying property.
Zhe Lin, Minghui Ma
doaj +1 more source
A Sequent Systems without Improper Derivations
Bulletin of the Section of Logic, 2022 In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper, and others proper. Improper inference rules are
Katsumi Sasaki
doaj +1 more source
Journal of Interventional Cardiology, 2021 Objectives. The present study was designed to compare the characteristics and performance regarding drug delivery of a novel drug-coated balloon (DCB) to a benchmark device (Restore® versus SeQuent® Please) in an in vitro and in vivo model.
Congying Xia +5 more
doaj +1 more source
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic.
Luís Pinto, Tarmo Uustalu
doaj +1 more source