Results 21 to 30 of about 170,956 (278)

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

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   +1 more source

Sequent calculus for hybrid logic

Lietuvos Matematikos Rinkinys, 2023
There is not ...
Stanislovas Norgėla, Anželika Šalaviejienė   +1 more
doaj   +3 more sources

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

A sequent calculus with dependent types for classical arithmetic [PDF]

Logic in Computer Science, 2018
In a recent paper [11], Herbelin developed dPAω, a calculus in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a stream of it components ...
Étienne Miquey
semanticscholar   +1 more source

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

Cut free sequent calculus for logic S5n(ED)

Lietuvos Matematikos Rinkinys, 2010
Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are considered in this paper. Gentzen style sequent calculus is constructed and its equivalence with Hilbert style system is proved, getting soundness and ...
Haroldas Giedra
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

Multi-succedent sequent calculus for intuitionistic epistemic logic

Lietuvos Matematikos Rinkinys
A multi-succedent sequent calculus for intuitionistic epistemic logic (IEL) is introduced in the paper. It is  proved that the structural rules of weakening and contraction and the rule of cut are admissible in the  calculus.
Romas Alonderis
doaj   +3 more sources