We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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 .
To save content items to your Kindle, first ensure no-reply@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.
Classical logic is concerned, loosely, with the behaviour of truths. Epistemic logic similarly is about the behaviour of known or believed truths. Justification logic is a theory of reasoning that enables the tracking of evidence for statements and therefore provides a logical framework for the reliability of assertions. This book, the first in the area, is a systematic account of the subject, progressing from modal logic through to the establishment of an arithmetic interpretation of intuitionistic logic. The presentation is mathematically rigorous but in a style that will appeal to readers from a wide variety of areas to which the theory applies. These include mathematical logic, artificial intelligence, computer science, philosophical logic and epistemology, linguistics, and game theory.
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first order S5 interpolation theorem can be proved provided the logic is extended to contain propositional quantifiers. A proper statement of the result involves some subtleties, but this is the essence of it.