David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 58 (2):514-545 (1993)
We present a Kripke model for Girard's Linear Logic (without exponentials) in a conservative fashion where the logical functors beyond the basic lattice operations may be added one by one without recourse to such things as negation. You can either have some logical functors or not as you choose. Commutatively and associatively are isolated in such a way that the base Kripke model is a model for noncommutative, nonassociative Linear Logic. We also extend the logic by adding a coimplication operator, similar to Curry's subtraction operator, which is resituated with Linear Logic's contensor product. And we can add contraction to get nondistributive Relevance Logic. The model rests heavily on Urquhart's representation of nondistributive lattices and also on Dunn's Gaggle Theory. Indeed, the paper may be viewed as an investigation into nondistributive Gaggle Theory restricted to binary operations. The valuations on the Kripke model are three valued: true, false, and indifferent. The lattice representation theorem of Urquhart has the nice feature of yielding Priestley's representation theorem for distributive lattices if the original lattice happens to be distributive. Hence the representation is consistent with Stone's representation of distributive and Boolean lattices, and our semantics is consistent with the Lemmon-Scott representation of modal algebras and the Routley-Meyer semantics for Relevance Logic
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Edwin Mares & Francesco Paoli (2014). Logical Consequence and the Paradoxes. Journal of Philosophical Logic 43 (2-3):439-469.
Eunsuk Yang (2014). Algebraic Kripke-Style Semantics for Relevance Logics. Journal of Philosophical Logic 43 (4):803-826.
Tomoyuki Suzuki (2013). A Sahlqvist Theorem for Substructural Logic. Review of Symbolic Logic 6 (2):229-253.
Similar books and articles
Peter Milne (2004). Algebras of Intervals and a Logic of Conditional Assertions. Journal of Philosophical Logic 33 (5):497-548.
Hiroakira Ono & Akira Nakamura (1980). On the Size of Refutation Kripke Models for Some Linear Modal and Tense Logics. Studia Logica 39 (4):325 - 333.
Gerard Allwein, Hilmi Demir & Lee Pike (2004). Logics for Classes of Boolean Monoids. Journal of Logic, Language and Information 13 (3):241-266.
Sergei P. Odintsov (2004). On the Representation of N4-Lattices. Studia Logica 76 (3):385 - 405.
Chrysafis Hartonas (1997). Duality for Lattice-Ordered Algebras and for Normal Algebraizable Logics. Studia Logica 58 (3):403-450.
Thomas Ehrhard (2004). A Completeness Theorem for Symmetric Product Phase Spaces. Journal of Symbolic Logic 69 (2):340 - 370.
Josep M. Font & Ventura Verdú (1993). The Lattice of Distributive Closure Operators Over an Algebra. Studia Logica 52 (1):1 - 13.
Gerard Allwein & Wendy MacCaull (2001). A Kripke Semantics for the Logic of Gelfand Quantales. Studia Logica 68 (2):173-228.
Sebastiaan A. Terwijn (2007). Kripke Models, Distributive Lattices, and Medvedev Degrees. Studia Logica 85 (3):319 - 332.
Added to index2009-01-28
Total downloads34 ( #60,461 of 1,679,326 )
Recent downloads (6 months)4 ( #60,347 of 1,679,326 )
How can I increase my downloads?