Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T02:36:04.375Z Has data issue: false hasContentIssue false

Kripke models for linear logic

Published online by Cambridge University Press:  12 March 2014

Gerard Allwein
Affiliation:
Computer Science Department, Center for Innovative Computer Applications, Indiana University, Bloomington, Indiana 47405, E-mail: gtall@cs.indiana.edu
J. Michael Dunn
Affiliation:
Philosophy Department, Computer Science Department, Indiana University, Bloomington, Indiana 47405, E-mail: dunn@cs.indiana.edu

Abstract

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. Commutativity and associativity 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 residuated with Linear Logic's cotensor 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable