Results 1 to 10 of about 170,956 (278)
A sequent calculus for a semi-associative law [PDF]
Logical 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 +9 more sources
A Sequent Calculus for Opetopes [PDF]
2019 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 $\omega$ -categories, which was the
Cédric Ho Thanh, P. Curien, S. Mimram
semanticscholar +3 more sources
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic.
Arno Ehle +2 more
doaj +3 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
A calculus of multiary sequent terms [PDF]
ACM Transactions on Computational Logic, 2011 Multiary sequent terms were originally introduced as a tool for proving termination of permutative conversions in cut-free sequent calculus. This work develops the language of multiary sequent terms into a term calculus for the computational (Curry-Howard) interpretation of a fragment of sequent calculus with cuts and cut-elimination rules.
Luis Pinto, JOSÉ Espirito Santo
exaly +3 more sources
Semi-Axiomatic Sequent Calculus
International Conference on Formal Structures for Computation and Deduction, 2020 We present the semi-axiomatic sequent calculus (SAX) that blends features of Gentzen’s sequent calculus with an axiomatic formulation of intuitionistic logic. We develop and prove a suitable analogue to cut elimination and then show that a natural computational interpretation of SAX provides a simple form of shared memory concurrency.
Henry Deyoung, F. Pfenning, K. Pruiksma
semanticscholar +4 more sources
A Classical Sequent Calculus with Dependent Types [PDF]
ACM Transactions on Programming Languages and Systems, 2017 Dependent types are a key feature of the proof assistants based on the Curry-Howard isomorphism. It is well known that this correspondence can be extended to classical logic by enriching the language of proofs with control operators.
Étienne Miquey
semanticscholar +6 more sources
The Sequent Calculus of Skew Monoidal Categories
Electronic Notes in Theoretical Computer Science, 2018 Szlachanyi's skew monoidal categories are a well-motivated variation of monoidal categories in which the unitors and associator are not required to be natural isomorphisms, but merely natural transformations in a particular direction.
Tarmo Uustalu +2 more
exaly +2 more sources
Sequent Calculus for Euler Diagrams [PDF]
Diagrams, 2018 Proof systems play a major role in the formal study of diagrammatic logical systems. Typically, the style of inference is not directly comparable to traditional sentential systems, to study the diagrammatic aspects of inference. In this work, we present a proof system for Euler diagrams with shading in the style of sequent calculus.
Sven Linker
semanticscholar +2 more sources
Yet Another Bijection Between Sequent Calculus and Natural Deduction
Electronic Notes in Theoretical Computer Science, 2015 This work shows a bijection between sequent calculus and natural deduction for intuitionistic propositional logic so far as normal and cut-free derivations are concerned.
Gilles Dowek, Edward Haeusler
exaly +2 more sources