scispace - formally typeset
Open AccessDissertation

The proof theory and semantics of intuitionistic modal logic

Alex Simpson
Reads0
Chats0
TLDR
This thesis investigates the intuitionistic modal logics that arise when the semantic definitions in the ordinary meta-theory of informal classical mathematics are interpreted in an intuitionistic meta- theory that no longer satisfy certain intuitionistically invalid principles.
Abstract
Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic definitions are interpreted in an intuitionistic meta-theory then the induced modal logics no longer satisfy certain intuitionistically invalid principles. This thesis investigates the intuitionistic modal logics that arise in this way. Natural deduction systems for various intuitionistic modal logics are presented. From one point of view, these systems are self-justifying in that a possible world interpretation of the modalities can be read off directly from the inference rules. A technical justification is given by the faithfulness of translations into intuitionistic first-order logic. It is also established that, in many cases, the natural deduction systems induce well-known intuitionistic modal logics, previously given by Hilbert-style axiomatizations. The main benefit of the natural deduction systems over axiomatizations is their susceptibility to proof-theoretic techniques. Strong normalization (and confluence) results are proved for all of the systems. Normalization is then used to establish the completeness of cut-free sequent calculi for all of the systems, and decidability for some of the systems. Lastly, techniques developed throughout the thesis are used to establish that those intuitionistic modal logics proved decidable also satisfy the finite model property. For the logics considered, decidability and the finite model property presented open problems.

read more

Citations
More filters
Book

Logic in Computer Science: Modelling and Reasoning about Systems

TL;DR: This book provides a simple and clear presentation, covering propositional and predicate logic and some specialized logics used for reasoning about the correctness of computer systems.
Journal ArticleDOI

Logic in Computer Science: Modelling and Reasoning About Systems

TL;DR: Logic mathematics and computer science modern foundations with practical applications and automated reasoning and mathematics essays in memory of william w mccune lecture notes in computer science PDF
Journal ArticleDOI

Proof Analysis in Modal Logic

TL;DR: A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics and it can be extended to treat also Gödel–Löb provability logic.
Journal ArticleDOI

Contextual modal type theory

TL;DR: The consequences of relativizing contextual modal logic and its type-theoretic analogue to explicitly specified contexts are investigated.
Book ChapterDOI

14 Hybrid logics

TL;DR: This chapter discusses the proof theory, expressivity, and complexity of a number of the well-known hybrid logics and provides a snapshot of the logical territory lying between the basic modal languages and their classical companions.
References
More filters
Book

Communication and Concurrency

TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Book

Naming and Necessity

TL;DR: In this paper, the authors make a connection between the mind-body problem and the so-called "identity thesis" in analytic philosophy, which has wide-ranging implications for other problems in philosophy that traditionally might be thought far-removed.
Book

An Introduction to Modal Logic

TL;DR: This long-awaited book replaces Hughes and Cresswell's two classic studies of modal logic with all the new developments that have taken place since 1968 in both modal propositional logic and modal predicate logic, without sacrificing clarity of exposition and approachability.
Book

Mathematical logic

Book

Proofs and types

TL;DR: In this paper, the Curry-Howard isomorphism and the normalisation theorem of a natural deduction system T coherence spaces have been studied in the context of linear logic and linear logic semantics.