The fine structure of the intuitionistic borel hierarchy

Review of Symbolic Logic 2 (1):30-101 (2009)
  Copy   BIBTEX

Abstract

In intuitionistic analysis, a subset of a Polish space like or is called positively Borel if and only if it is an open subset of the space or a closed subset of the space or the result of forming either the countable union or the countable intersection of an infinite sequence of (earlier constructed) positively Borel subsets of the space. The operation of taking the complement is absent from this inductive definition, and, in fact, the complement of a positively Borel set is not always positively Borel itself (see Veldman, 2008a). The main result of Veldman (2008a) is that, assuming Brouwer's Continuity Principle and an Axiom of Countable Choice, one may prove that the hierarchy formed by the positively Borel sets is genuinely growing: every level of the hierarchy contains sets that do not occur at any lower level. The purpose of the present paper is a different one: we want to explore the truly remarkable fine structure of the hierarchy. Brouwer's Continuity Principle again is our main tool. A second axiom proposed by Brouwer, his Thesis on Bars is also used, but only incidentally

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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

Two simple sets that are not positively Borel.Wim Veldman - 2005 - Annals of Pure and Applied Logic 135 (1-3):151-209.
Projective subsets of separable metric spaces.Arnold W. Miller - 1990 - Annals of Pure and Applied Logic 50 (1):53-69.
A q-wadge hierarchy in quasi-polish spaces.Victor Selivanov - 2020 - Journal of Symbolic Logic:1-26.
New directions in descriptive set theory.Alexander S. Kechris - 1999 - Bulletin of Symbolic Logic 5 (2):161-174.
Long Borel hierarchies.Arnold W. Miller - 2008 - Mathematical Logic Quarterly 54 (3):307-322.
Every Borel function is monotone Borel.Boško Živaljević - 1991 - Annals of Pure and Applied Logic 54 (1):87-99.

Analytics

Added to PP
2009-05-29

Downloads
88 (#237,781)

6 months
14 (#225,286)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Many-One Reducibility with Realizability.Takayuki Kihara - forthcoming - Journal of Symbolic Logic:1-39.

Add more citations

References found in this work

Constructive Analysis.Errett Bishop & Douglas Bridges - 1987 - Journal of Symbolic Logic 52 (4):1047-1048.
Two simple sets that are not positively Borel.Wim Veldman - 2005 - Annals of Pure and Applied Logic 135 (1-3):151-209.
An intuitionistic proof of Kruskal’s theorem.Wim Veldman - 2004 - Archive for Mathematical Logic 43 (2):215-264.

Add more references