Results 1 to 10 of about 136,655 (280)
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.
Luís Pinto, José Espirito Santo
exaly +6 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 +5 more sources
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 +8 more sources
A sequent calculus for a logic of contingencies
Journal of Applied Logic, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Approaches to Polymorphism in Classical Sequent Calculus [PDF]
Lecture Notes in Computer Science, 2006 $\mathcal X$ is a relatively new calculus, invented to give a Curry-Howard correspondence with Classical Implicative Sequent Calculus. It is already known to provide a very expressive language; embeddings have been defined of the λ-calculus, Bloo and Rose's λx, Parigot's λμ and Curien and Herbelin's ${\overline{\lambda}\mu\tilde{\mu}}$.
Steffen van Bakel, Alexander J. Summers
exaly +2 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
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 ω-categories, which was the original motivation for their introduction by Baez and Dolan.
Ho Thanh, Cédric +2 more
openaire +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
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