Extension of Lifschitz' realizability to higher order arithmetic, and a solution to a problem of F. Richman

Journal of Symbolic Logic 56 (3):964-973 (1991)
  Copy   BIBTEX

Abstract

F. Richman raised the question of whether the following principle of second order arithmetic is valid in intuitionistic higher order arithmetic $\mathbf{HAH}$: $\forall X\lbrack\forall x(x \in X \vee \neg x \in X) \wedge \forall Y(\forall x(x \in Y \vee \neg x \in Y) \rightarrow \forall x(x \in X \rightarrow x \in Y) \vee \forall x \neg(x \in X \wedge x \in Y)) \rightarrow \exists n\forall x(x \in X \rightarrow x = n)\rbrack$, and if not, whether assuming Church's Thesis CT and Markov's Principle MP would help. Blass and Scedrov gave models of $\mathbf{HAH}$ in which this principle, which we call RP, is not valid, but their models do not satisfy either CT or MP. In this paper a realizability topos Lif is constructed in which CT and MP hold, but RP is false. (It is shown, however, that $RP$ is derivable in $\mathbf{HAH} + \mathrm{CT} + \mathrm{MP} + \mathrm{ECT}_0$, so RP holds in the effective topos.) Lif is a generalization of a realizability notion invented by V. Lifschitz. Furthermore, Lif is a subtopos of the effective topos

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,314

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
75 (#289,479)

6 months
4 (#864,415)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jaap Van Oosten
Leiden University

Citations of this work

Rules and Arithmetics.Albert Visser - 1999 - Notre Dame Journal of Formal Logic 40 (1):116-140.
Basic subtoposes of the effective topos.Sori Lee & Jaap van Oosten - 2013 - Annals of Pure and Applied Logic 164 (9):866-883.

Add more citations

References found in this work

Topos Theory.P. T. Johnstone - 1982 - Journal of Symbolic Logic 47 (2):448-450.

Add more references