Results 11 to 20 of about 2,868 (293)

Semi-Axiomatic Sequent Calculus [PDF]

open access: yes, 2020
We present the semi-axiomatic sequent calculus (SAX) that blends features of Gentzen’s sequent calculus with an axiomatic formulation of intuitionistic logic.
DeYoung, Henry   +2 more
core   +4 more sources

A sequent calculus for a semi-associative law [PDF]

open access: yesLogical Methods in Computer Science, 2019
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a semi-associative law ...
Noam Zeilberger
doaj   +7 more sources

Curry-Howard for sequent calculus at last! [PDF]

open access: yes, 2015
This paper tries to remove what seems to be the remaining stumbling blocks in the way to a full understanding of the Curry-Howard isomorphism for sequent calculus, namely the questions: What do variables in proof terms stand for? What is co-control and a
Espírito Santo, José
core   +5 more sources

A Sequent Calculus for Opetopes [PDF]

open access: yes2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019
Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak ω-categories, which was the original motivation for their introduction by Baez and Dolan.
Ho Thanh, Cédric   +2 more
openaire   +2 more sources

Grokking the Sequent Calculus (Functional Pearl)

open access: yesProceedings of the ACM on Programming Languages
The sequent calculus is a proof system which was designed as a more symmetric alternative to natural deduction. The {\lambda}{\mu}{\mu}-calculus is a term assignment system for the sequent calculus and a great foundation for compiler intermediate ...
Müller, Marius   +3 more
core   +3 more sources

Restrictions for loop-check in sequent calculus for temporal logic with until operator

open access: yesLietuvos 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

Restrictions for loop-check in sequent calculus for temporal logic

open access: yesLietuvos 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

Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]

open access: yesElectronic 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

Revising a Labelled Sequent Calculus for Public Announcement Logic [PDF]

open access: yes, 2015
We first show that a labelled sequent calculus G3PAL for Public AnnouncementLogic (PAL) by Maffezioli and Negri (2011) has been lacking rulesfor deriving an axiom of Hilbert-style axiomatization of PAL.
Katsuhiko Sano   +5 more
core   +1 more source

Cut free sequent calculus for logic S5n(ED)

open access: yesLietuvos 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

Home - About - Disclaimer - Privacy