If you need an accessible version of this item please contact JSTOR User Support

Kripke Models for Linear Logic

Gerard Allwein and J. Michael Dunn
The Journal of Symbolic Logic
Vol. 58, No. 2 (Jun., 1993), pp. 514-545
DOI: 10.2307/2275217
Stable URL: http://www.jstor.org/stable/2275217
Page Count: 32
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Kripke Models for Linear Logic
Preview not available

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. 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.

Page Thumbnails

  • Thumbnail: Page 
514
    514
  • Thumbnail: Page 
515
    515
  • Thumbnail: Page 
516
    516
  • Thumbnail: Page 
517
    517
  • Thumbnail: Page 
518
    518
  • Thumbnail: Page 
519
    519
  • Thumbnail: Page 
520
    520
  • Thumbnail: Page 
521
    521
  • Thumbnail: Page 
522
    522
  • Thumbnail: Page 
523
    523
  • Thumbnail: Page 
524
    524
  • Thumbnail: Page 
525
    525
  • Thumbnail: Page 
526
    526
  • Thumbnail: Page 
527
    527
  • Thumbnail: Page 
528
    528
  • Thumbnail: Page 
529
    529
  • Thumbnail: Page 
530
    530
  • Thumbnail: Page 
531
    531
  • Thumbnail: Page 
532
    532
  • Thumbnail: Page 
533
    533
  • Thumbnail: Page 
534
    534
  • Thumbnail: Page 
535
    535
  • Thumbnail: Page 
536
    536
  • Thumbnail: Page 
537
    537
  • Thumbnail: Page 
538
    538
  • Thumbnail: Page 
539
    539
  • Thumbnail: Page 
540
    540
  • Thumbnail: Page 
541
    541
  • Thumbnail: Page 
542
    542
  • Thumbnail: Page 
543
    543
  • Thumbnail: Page 
544
    544
  • Thumbnail: Page 
545
    545