Classical and constructive hierarchies in extended intuitionistic analysis

Journal of Symbolic Logic 68 (3):1015-1043 (2003)
This paper introduces an extension A of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(α) on Baire space with the property that every constructive partial functional defined on {α : R(α)} is continuous there. The domains of continuity for A coincide with the stable relations (those equivalent in A to their double negations), while every relation R(α) is equivalent in A to ∃αA(α, β) for some stable A(α, β) (which belongs to the classical analytical hierarchy). The logic of A is intuitionistic. The axioms of A include countable comprehension, bar induction, Troelstra's generalized continuous choice, primitive recursive Markov's Principle and a classical axiom of dependent choices proposed by Krauss. Constructive dependent choices, and constructive and classical countable choice, are theorems, A is maximal with respect to classical Kleene function realizability, which establishes its consistency. The usual disjunction and (recursive) existence properties ensure that A preserves the constructive sense of "or" and "there exists."
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1058448452
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,470
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Joan Rand Moschovakis (2002). Analyzing Realizability by Troelstra's Methods. Annals of Pure and Applied Logic 114 (1-3):203-225.

Add more references

Citations of this work BETA
Wim Veldman (2005). Two Simple Sets That Are Not Positively Borel. Annals of Pure and Applied Logic 135 (1-3):151-209.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

11 ( #381,669 of 1,925,550 )

Recent downloads (6 months)

1 ( #418,152 of 1,925,550 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.