Results 41 to 50 of about 165,353 (118)
Combinatorial structure of type dependency [PDF]
, 2014 We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf category. The
Garner, Richard
core +1 more source
Realisability semantics of abstract focussing, formalised [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present a sequent calculus for abstract focussing, equipped with proof-terms: in the tradition of Zeilberger's work, logical connectives and their introduction rules are left as a parameter of the system, which collapses the synchronous and ...
Stéphane Graham-Lengrand
doaj +1 more source
Systematic construction of natural deduction systems for many-valued logics [PDF]
, 1993 A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables
Baaz, Matthias +2 more
core +2 more sources
The Hidden Structural Rules of the Discontinuous Lambek Calculus
, 2013 The sequent calculus sL for the Lambek calculus L (lambek 58) has no structural rules. Interestingly, sL is equivalent to a multimodal calculus mL, which consists of the nonassociative Lambek calculus with the structural rule of associativity. This paper
A. Avron +3 more
core +1 more source
Completing herbelin's programme [PDF]
, 2007 In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the $\lambda$-calculus, specifically a variant which ...
Espírito Santo, José
core +1 more source
Lietuvos Matematikos Rinkinys, 2013 We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”. The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis +1 more
doaj +1 more source
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 +1 more source
Polarizing Double Negation Translations [PDF]
, 2013 Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations.
A. Kolmogorov +14 more
core +4 more sources
Contraction-free calculi for modal logics S5 and KD45
Lietuvos Matematikos Rinkinys, 2011 It is known that termination and backtracking are among the most important problems in constructing derivations in non-classical logics. In this paper contractionfree and backtracking-free sequent calculi for modal logics S5 and KD45 are presented and ...
Julius Andrikonis +1 more
doaj +1 more source
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 +1 more source