Monadic Intuitionistic and Modal Logics Admitting Provability Interpretations

  title={Monadic Intuitionistic and Modal Logics Admitting Provability Interpretations},
  author={Kristi L. Brantley},
  journal={The Bulletin of Symbolic Logic},
  pages={296 - 296}
  • Kristi L. Brantley
  • Published 1 December 2020
  • Philosophy, Computer Science
  • The Bulletin of Symbolic Logic
The Gödel translation provides an embedding of the intuitionistic logic IPC into the modal logic Grz, which then embeds into the modal logic GL via the splitting translation. Combined with Solovay’s theorem that GL is the modal logic of the provability predicate of Peano Arithmetic PA, both IPC and Grz admit arithmetical interpretations. When attempting to ‘lift’ these results to the monadic extensions MIPC, MGrz, and MGL of these logics, the same techniques no longer work. Following a… 



Semantics for a Class of Intuitionistic Modal Calculi

A general criterion is proposed which enables us to define a rather large number of intuitionistic modal calculi and the idea that lies behind this criterion is that of presenting a uniform rule by means of which the authors can find the ‘intuitionistic analogues’ for some of the most usual classical modal systems.

Provability as Modality

The embedding of intuitionistic logic into modal logic means that intuitionistic truth is defined in terms of proof and provability is necessity, and composition yields the embedding.

On Some Intuitionistic Modal Logics

Some modal logics based on logics weaker than the classical logic have been studied by Fitch [4], Prior [7], Bull [1], [2], [3], Prawitz [6] etc. Here we treat modal logics based on the

MIPC as the formalisation of an intuitionist concept of modality

This paper shall adapt Kripke's interpretation of his modelling to give an account of MIPC in terms of differing mathematical intuitions and may be regarded as a clarification of those rather inaccurate ideas in the light of Kripkes' outstanding analysis of the intuitionist predicate calculus.

Provability interpretations of modal logic

We consider interpretations of modal logic in Peano arithmetic (P) determined by an assignment of a sentencev* ofP to each propositional variablev. We put (⊥)*=“0 = 1”, (χ → ψ)* = “χ* → ψ*” and let

Temporal Interpretation of Intuitionistic Quantifiers

We show that intuitionistic quantifiers admit the following temporal interpretation: $\forall x A$ is true at a world $w$ iff $A$ is true at every object in the domain of every future world, and

Some theorems about the sentential calculi of Lewis and Heyting

This paper shall prove theorems about some systems of sentential calculus, by making use of results established elsewhere regarding closure algebras' and Brouwerian albegras, and the Lewis system and the Heyting system.

Modal logic

This paper shows how the tree or tableau method provides a simple and easily comprehensible decision procedure for systems such as K, T, S4 and S5 and how the formal techniques of modal logic can be used to analyse several informal problems involving modal concepts, including cases combining modality with quantification.

The finite model property for MIPQ and some consequences

  • G. Servi
  • Mathematics
    Notre Dame J. Formal Log.
  • 1978
The proof given in [l] that MIPQ has the finite model property is shown to be erroneous. Through the use of slightly different techniques we prove that this property nonetheless does hold. We then

On modal logic with an intuitionistic base

A definition of the concept of “Intuitionist Modal Analogue” is presented and motivated through the existence of a theorem preserving translation fromMIPC (see [2]) to a bimodalS4–S5 calculus.