Realizability semantics for quantified modal logic: Generalizing flagg’s 1985 construction

Review of Symbolic Logic 9 (4):752-809 (2016)
  Copy   BIBTEX

Abstract

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While the bulk of the paper is devoted to developing the details of the semantics, to illustrate the scope of this approach, we show that the construction produces (i) a model of a modal version of Church's Thesis and a variant of a modal set theory due to Goodman and Scedrov, (ii) a model of a modal version of Troelstra's generalized continuity principle together with a fragment of second-order arithmetic, and (iii) a model based on Scott's graph model (for the untyped lambda calculus) which witnesses the failure of the stability of non-identity.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 102,020

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2016-02-24

Downloads
64 (#336,327)

6 months
4 (#1,291,232)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Benjamin Rin
Utrecht University

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
On the interpretation of intuitionistic number theory.Stephen Cole Kleene - 1945 - Journal of Symbolic Logic 10 (4):109-124.
Constructivism in Mathematics, An Introduction.A. Troelstra & D. Van Dalen - 1991 - Tijdschrift Voor Filosofie 53 (3):569-570.
The |lambda-Calculus.H. P. Barendregt - 1981 - Philosophical Review 97 (1):132-137.

View all 14 references / Add more references