On the categorical semantics of elementary linear logic.
Laurent, Olivier (2009)
Theory and Applications of Categories [electronic only]
Similarity:
Displaying similar documents to “On Semantics of a Term Calculus for Classical Logic”
On the categorical semantics of elementary linear logic.
Computational Interrpretations of Logics
Silvia Ghilezan, Silvia Likavec (2009)
Zbornik Radova
Similarity:
A Parigot-style linear -calculus for full intuitionistic linear logic.
de Paiva, Valeria, Ritter, Eike (2006)
Theory and Applications of Categories [electronic only]
Similarity:
On the axiomatisation of Boolean categories with and without medial.
Strassburger, Lutz (2007)
Theory and Applications of Categories [electronic only]
Similarity:
Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem
Marco Caminati (2011)
Formalized Mathematics
Similarity:
Fifth of a series of articles laying down the bases for classical first order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first order language L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding all those concepts. Following that, it introduces a fixed set D of derivation rules, and proceeds to convert them to Mizar functorial cluster...
Approximable concepts, Chu spaces, and information systems.
Zhang, Guo-Qiang, Shen, Gongqin (2006)
Theory and Applications of Categories [electronic only]
Similarity:
On the geometry of intuitionistic S4 proofs.
Goubault-Larrecq, Jean, Goubault, Éric (2003)
Homology, Homotopy and Applications
Similarity:
Strong completeness of the Lambek Calculus with respect to Relational Semantics
Szabolcs Mikulás (1993)
Banach Center Publications
Similarity:
In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.
The Derivations of Temporal Logic Formulas
Mariusz Giero (2012)
Formalized Mathematics
Similarity:
This is a preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [12]. We introduce n-ary connectives and prove their properties. We derive temporal logic formulas.
Corcoran's Aristotelian syllogistic as a subsystem of first-order logic.
Andrade, Edgar J., Becerra, Edward (2007)
Revista Colombiana de Matemáticas
Similarity:
An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz.
Rimatskiĭ, V.V. (2009)
Sibirskij Matematicheskij Zhurnal
Similarity:
Strong normalization proofs for cut elimination in Gentzen's sequent calculi
Elias Bittar (1999)
Banach Center Publications
Similarity:
We define an equivalent variant of the Gentzen sequent calculus . In weakenings or contractions can be performed in parallel. This modification allows us to interpret a symmetrical system of mix elimination rules by a finite rewriting system; the termination of this rewriting system can be machine checked. We give also a self-contained strong normalization proof by structural induction. We give another strong normalization proof by a strictly monotone subrecursive interpretation;...
Normal forms in partial modal logic
Jan Jaspars (1993)
Banach Center Publications
Similarity:
A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].