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. (shrink)

In 1970 Vesley proposed a substitute of Kripke's Scheme. In this paper it is shown that —over Bishop's constructive mathematics— the indecomposability of negative dense subsets of ℝ is equivalent to a weakening of Vesley's proposal. This result supports the idea that full Kripke's Scheme might not be necessary for most of intuitionistic mathematics. At the same time it contributes to the programme of Constructive Reverse Mathematics and gives a new answer to a 1997 question of Van Dalen.