Results 1 to 10 of about 2,868 (293)

Sequent Calculus and Equational Programming [PDF]

open access: yesElectronic 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 calculus of multiary sequent terms [PDF]

open access: yesACM 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 ...
JOSÉ Espirito Santo, Luis Pinto
exaly   +4 more sources

The Sequent Calculus of Skew Monoidal Categories [PDF]

open access: yesElectronic Notes in Theoretical Computer Science, 2018
Szlachányi'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

Specialization of derivations in modal logic S5

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

open access: yesAxioms, 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]

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

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

open access: yesLietuvos Matematikos Rinkinys, 2023
There is not ...
Stanislovas Norgėla   +1 more
doaj   +3 more sources

Logic of knowledge with infinitely many agents

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

The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]

open access: yesElectronic 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   +1 more source

Home - About - Disclaimer - Privacy