Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-v5vhk Total loading time: 0 Render date: 2024-06-27T03:31:09.690Z Has data issue: false hasContentIssue false

9 - Modal and linear logic

Published online by Cambridge University Press:  05 June 2012

A. S. Troelstra
Affiliation:
Universiteit van Amsterdam
H. Schwichtenberg
Affiliation:
Universität Munchen
Get access

Summary

Another possible title for this chapter might have been “some non-standard logics”, since its principal aim is to illustrate how the methods we introduced for the standard logics M, I and C are applicable in different settings as well.

For the illustrations we have chosen two logics which are of considerable interest in their own right: the wellknown modal logic S4, and linear logic. For a long time modal logic used to be a fairly remote corner of logic. In recent times the interest in modal and tense logics has increased considerably, because of their usefulness in artificial intelligence and computer science. For example, modal logics have been used (1) in modelling epistemic notions such as belief and knowledge, (2) in the modelling of the behaviour of programs, (3) in the theory of non-monotonic reasoning.

The language of modal logics is an extension of the language of first-order predicate logic by one or more propositional operators, modal operators or modalities. Nowadays modal logics are extremely diverse: several primitive modalities, binary and ternary operators, intuitionistic logic as basis, etc. We have chosen S4 as our example, since it has a fairly well-investigated proof theory and provides us with the classic example of a modal embedding result: intuitionistic logic can be faithfully embedded into S4 via a so-called modal translation, a result presented in section 9.2.

Linear logic is one of the most interesting examples of what are often called “substructural logics” – logics which in their Gentzen systems do not have all the structural rules of Weakening, Exchange and Contraction.

Type
Chapter
Information
Basic Proof Theory , pp. 283 - 316
Publisher: Cambridge University Press
Print publication year: 2000

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

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×