Results 11 to 20 of about 15,159 (278)
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
Restrictions for loop-check in sequent calculus for temporal logic with until operator
Lietuvos Matematikos Rinkinys, 2009 In this paper, we present sequent calculus for branching-time temporal logic with until operator. This sequent calculus uses efficient loop-checktechinque.
Adomas Birštunas
doaj +1 more source
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
Canonical Proof nets for Classical Logic [PDF]
, 2012 Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof.
McKinley, Richard
core +2 more sources
Restrictions for loop-check in sequent calculus for temporal logic
Lietuvos Matematikos Rinkinys, 2008 In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses efficient loop-check techinque. We prove that we can use not all but only several special sequents from the derivation tree for the loop-check.
Adomas Birštunas
doaj +1 more source
Sequent calculus for propositional likelihood logic
Lietuvos Matematikos Rinkinys, 2023 There is not abstract.
Romas Alonderis
doaj +3 more sources