scispace - formally typeset
Open AccessDOI

Negative Translations and Normal Modality.

Tadeusz Litak, +2 more
- Vol. 84, pp 18
Reads0
Chats0
TLDR
A large class of computationally relevant modal logics - namely, logics of type inhabitation for applicative functors (a.k.a. idioms) - turns out to validate the modal counterpart of the Double Negation Shift, thus ensuring adequacy of even the Glivenko translation.
Abstract
We discuss the behaviour of variants of the standard negative translations - Kolmogorov, Godel-Gentzen, Kuroda and Glivenko - in propositional logics with a unary normal modality. More specifically, we address the question whether negative translations as a rule embed faithfully a classical modal logic into its intuitionistic counterpart. As it turns out, even the Kolmogorov translation can go wrong with rather natural modal principles. Nevertheless, we isolate sufficient syntactic criteria ensuring adequacy of well-behaved (or, in our terminology, regular) translations for logics axiomatized with formulas satisfying these criteria, which we call enveloped implications. Furthermore, a large class of computationally relevant modal logics - namely, logics of type inhabitation for applicative functors (a.k.a. idioms) - turns out to validate the modal counterpart of the Double Negation Shift, thus ensuring adequacy of even the Glivenko translation. All our positive results are proved purely syntactically, using the minimal natural deduction system of Bellin, de Paiva and Ritter extended with additional axioms/combinators and hence also allow a direct formalization in a proof assistant (in our case Coq).

read more

Citations
More filters
Journal ArticleDOI

Axiomatic and dual systems for constructive necessity, a formally verified equivalence

TL;DR: A proof of the equivalence between two deductive systems for constructive necessity, namely an axiomatic characterisation inspired by Hakli and Negri's system of derivations from assumptions for modal logic, a Hilbert-style formalism designed to ensure the validity of the deduction theorem, and the judgmental reconstruction given by Pfenning and Davies by means of a natural deduction approach.
Proceedings Article

An Algebraic Glimpse at Bunched Implications and Separation Logic

TL;DR: The logic of Bunched Implications (BI) and Separation Logic is overviewed from a perspective inspired by Hiroakira Ono's algebraic approach to substructural logics and an algebraic proof of cut elimination in the setting of residuated frames of Galatos and Jipsen is presented.
Proceedings ArticleDOI

Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem

TL;DR: The characterisation works in the fairly universal setting of a consequence relation enriched with non-deterministic axioms; uniformises many of the known instances of the dynamical method; generalises the proof-theoretic conservation criterion the authors have offered before (with Rinaldi); and links the syntactical with the semantic approach.
Proceedings ArticleDOI

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis implication

TL;DR: In this paper, the authors define descriptive frames (generalisations of Esakia spaces) and establish a categorical duality between the algebraic interpretation and the frame semantics, which allows them to prove a Blok-Esakia theorem that they then use to obtain both known and new canonicity and correspondence theorems.
References
More filters
Journal ArticleDOI

The logic of bunched implications.

TL;DR: A logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side is introduced and computational interpretations, based on sharing, at both the propositional and predicate levels are discussed.
Proceedings ArticleDOI

A formulae-as-type notion of control

TL;DR: It is proved that all evaluations of typed terms in Idealized Scheme are finite, and the existence of computationally interesting “classical programs” is illustrated by the definition of conjunctively, disjunctive, and existential types using standard classical definitions.
Book

The logic of provability

George Boolos
TL;DR: In this paper, the completeness and decidability of GL and other modal logics are discussed, including the fixed-point theorem, the fixed point theorem, letterless sentences, and analysis.
Dissertation

The proof theory and semantics of intuitionistic modal logic

Alex Simpson
TL;DR: 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.
Journal ArticleDOI

Applicative programming with effects

TL;DR: An abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread, is introduced and a bracket notation is introduced that interprets the normal application syntax in the idiom of an Applicative functor.
Related Papers (5)