Analyzing realizability by Troelstra's methods

Annals of Pure and Applied Logic 114 (1-3):203-225 (2002)
  Copy   BIBTEX

Abstract

Realizabilities are powerful tools for establishing consistency and independence results for theories based on intuitionistic logic. Troelstra discovered principles ECT 0 and GC 1 which precisely characterize formal number and function realizability for intuitionistic arithmetic and analysis, respectively. Building on Troelstra's results and using his methods, we introduce the notions of Church domain and domain of continuity in order to demonstrate the optimality of “almost negativity” in ECT 0 and GC 1 ; strengthen “double negation shift” DNS 0 to DNS 1 and use it with GC 1 and Markov's Principle MP to characterize the classically provably realizable formulas of analysis; and show that intuitionistic analysis with GC 1 , MP and DNS 1 is consistent and satisfies Troelstra's and Church's Rules. We end with a discussion of semi-intuitionistic theories and a conjecture

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,410

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
2014-01-16

Downloads
18 (#1,000,511)

6 months
3 (#1,434,963)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joan Rand Moschovakis
Occidental College

Citations of this work

Add more citations

References found in this work

On the interpretation of intuitionistic number theory.S. C. Kleene - 1945 - Journal of Symbolic Logic 10 (4):109-124.
Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
Some applications of Kleene's methods for intuitionistic systems.Harvey Friedman - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 113--170.
Realizability.A. S. Troelstra - 2000 - Bulletin of Symbolic Logic 6 (4):470-471.

View all 16 references / Add more references