Results 1 to 10 of about 14,188 (137)
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 and Equational Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style. We
Nicolas Guenot, Daniel Gustafsson
doaj +4 more sources
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
Fast Cut-Elimination using Proof Terms: An Empirical Study [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Gabriel Ebner
doaj +4 more sources
Specialization of derivations in modal logic S5
Lietuvos Matematikos Rinkinys, 2023 Loop-check-free decidable specialization of sequent calculus for modal logic S5 is presented. Soundness and completness of this calculus is proved.
Aida Pliuškevičienė
doaj +3 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
Sequent calculus for hybrid logic
Lietuvos Matematikos Rinkinys, 2023 There is not ...
Stanislovas Norgėla +1 more
doaj +3 more sources
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
Logic of knowledge with infinitely many agents
Lietuvos Matematikos Rinkinys, 2023 Cut-free sequent calculus for logic of knowledge with infinitely many agents, based on multimodul S5n.
Regimantas Pliuškevičius
doaj +3 more sources