scholarly journals THE FINE STRUCTURE OF THE INTUITIONISTIC BOREL HIERARCHY

2009 ◽  
Vol 2 (1) ◽  
pp. 30-101 ◽  
Author(s):  
WIM VELDMAN
Keyword(s):  
Fine Structure ◽  
Infinite Sequence ◽  
Polish Space ◽  
Main Tool ◽  
Inductive Definition ◽  
Borel Set ◽  
Borel Sets ◽  
Continuity Principle ◽  
Borel Hierarchy ◽  
Axiom Of Countable Choice

In intuitionistic analysis, a subset of a Polish space like ℝ or ${\cal N}$ 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.

scholarly journals The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective

2008 ◽  
Vol 73 (1) ◽  
pp. 1-64 ◽  
Author(s):  
Wim Veldman
Keyword(s):  
Borel Sets ◽  
Continuity Principle ◽  
Borel Hierarchy ◽  
Axiom Of Countable Choice

AbstractIn intuitionistic analysis, Brouwer's Continuity Principle implies, together with an Axiom of Countable Choice, that the positively Borel sets form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level.

Boolean operations, Borel sets, and Hausdorff's question

1996 ◽  
Vol 61 (4) ◽  
pp. 1287-1304
Author(s):  
Abhijit Dasgupta
Keyword(s):  
Polish Space ◽  
Descriptive Set Theory ◽  
Boolean Operation ◽  
Boolean Operations ◽  
Borel Sets ◽  
Systematic Fashion ◽  
Borel Hierarchy ◽  
The Difference ◽  
Projective Hierarchy ◽  
Descriptive Set

The study of infinitary Boolean operations was undertaken by the early researchers of descriptive set theory soon after Suslin's discovery of the important operation. The first attempt to lay down their theory in a systematic fashion was the work of Kantorovich and Livenson [5], where they call these the analytical operations. Earlier, Hausdorff had introduced the δs operations — essentially same as the monotoneω-ary Boolean operations, and Kolmogorov, independently of Hausdorff, had discovered the same objects, which were used in his study of the R operator.The ω-ary Boolean operations turned out to be closely related to most of the classical hierarchies over a fixed Polish space X, including, e. g., the Borel hierarchy (), the difference hierarchies of Hausdorff (Dη()), the C-hierarchy (Cξ) of Selivanovski, and the projective hierarchy (): for each of these hierarchies, every level can be expressed as the range of an ω-ary Boolean operation applied to all possible sequences of open subsets of X. In the terminology of Dougherty [3], every level is “open-ω-Boolean” (if and are collections of subsets of X and I is any set, is said to be -I-Boolean if there exists an I-ary Boolean operation Φ such that = Φ, i. e. is the range of Φ restricted to all possible I-sequences of sets from ). If in addition, the space X has a basis consisting of clopen sets, then the levels of the above hierarchies are also “clopen-ω-Boolean.”

scholarly journals Forcing Properties of Ideals of Closed Sets

2011 ◽  
Vol 76 (3) ◽  
pp. 1075-1095 ◽  
Author(s):  
Marcin Sabok ◽  
Jindřich Zapletal
Keyword(s):  
Polish Space ◽  
Borel Function ◽  
Constant Property ◽  
Borel Set ◽  
Borel Sets ◽  
Combinatorial Properties ◽  
Closed Sets ◽  
Cohen Real ◽  
The Ideal

AbstractWith every σ-ideal I on a Polish space we associate the σ-ideal I* generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ -ideals I and I* and find connections between their forcing properties. To this end, we associate to a σ-ideal on a Polish space an ideal on a countable set and show how forcing properties of the forcing depend on combinatorial properties of the ideal.We also study the 1–1 or constant property of σ-ideals, i.e., the property that every Borel function defined on a Borel positive set can be restricted to a positive Borel set on which it either 1–1 or constant. We prove the following dichotomy: if I is a σ-ideal generated by closed sets, then either the forcing P1 adds a Cohen real, or else I has the 1–1 or constant property.

Ideals without ccc

1998 ◽  
Vol 63 (1) ◽  
pp. 128-148 ◽  
Author(s):  
Marek Balcerzak ◽  
Andrzej RosŁanowski ◽  
Saharon Shelah
Keyword(s):  
Polish Space ◽  
Borel Function ◽  
Borel Set ◽  
Borel Sets ◽  
Polish Groups ◽  
Perfect Set ◽  
Consistency Results ◽  
The Family ◽  
Whole Space ◽  
Condition B

AbstractLet I be an ideal of subsets of a Polish space X, containing all singletons and possessing a Borel basis. Assuming that I does not satisfy ccc, we consider the following conditions (B), (M) and (D). Condition (B) states that there is a disjoint family F ⊆ P(X) of size ϲ, consisting of Borel sets which are not in I. Condition (M) states that there is a Borel function f : X → X with f−1[{x}] ∉ I for each x ∈ X. Provided that X is a group and I is invariant, condition (D) states that there exist a Borel set B ∉ I and a perfect set P ⊆ X for which the family {B+x : x ∈ P} is disjoint. The aim of the paper is to study whether the reverse implications in the chain (D) ⇒ (M) ⇒ (B) ⇒ not-ccc can hold. We build a σ-ideal on the Cantor group witnessing (M) & ¬(D) (Section 2). A modified version of that σ-ideal contains the whole space (Section 3). Some consistency results on deriving (M) from (B) for “nicely” defined ideals are established (Sections 4 and 5). We show that both ccc and (M) can fail (Theorems 1.3 and 5.6). Finally, some sharp version's of (M) for invariant ideals on Polish groups are investigated (Section 6).

Louveau's theorem for the descriptive set theory of internal sets

1997 ◽  
Vol 62 (2) ◽  
pp. 595-607
Author(s):  
Kenneth Schilling ◽  
Boško Živaljević
Keyword(s):  
Polish Space ◽  
Borel Subset ◽  
Measurable Space ◽  
Borel Sets ◽  
Polish Spaces ◽  
Borel Hierarchy ◽  
Open Questions ◽  
Vertical Sections ◽  
Almost All ◽  
Internal Sets

AbstractWe give positive answers to two open questions from [15]. (1) For every set C countably determined over , if C is then it must be over , and (2) every Borel subset of the product of two internal sets X and Y all of whose vertical sections are can be represented as an intersection (union) of Borel sets with vertical sections of lower Borel rank. We in fact show that (2) is a consequence of the analogous result in the case when X is a measurable space and Y a complete separable metric space (Polish space) which was proved by A. Louveau and that (1) is equivalent to the property shared by the inverse standard part map in Polish spaces of preserving almost all levels of the Borel hierarchy.

Descriptive sets

1966 ◽  
Vol 291 (1426) ◽  
pp. 353-367 ◽  
Keyword(s):  
Metric Space ◽  
Regular Space ◽  
Countable Union ◽  
Borel Set ◽  
Borel Sets ◽  
Countable Intersection ◽  
Completely Regular ◽  
Closed Sets ◽  
Open Set

A theory of descriptive Baire sets is developed for an arbitrary completely regular space. It is shown that descriptive Baire sets are Baire sets and that they form a system closed under countable union, countable intersection and intersection with a Baire set. If a descriptive Borel set (Rogers 1965) is a Baire set then it is a descriptive Baire set. If every open set is a countable union of closed sets, the descriptive Baire sets coincide with the descriptive Borel sets. It follows, in particular, that in a metric space a set is descriptive Baire, if, and only if, it is absolutely Borel and Lindelöf.

First steps in intuitionistic model theory

1978 ◽  
Vol 43 (1) ◽  
pp. 3-12 ◽  
Author(s):  
H. de Swart
Keyword(s):  
Model Theory ◽  
Infinite Sequence ◽  
Finite Sequence ◽  
Kripke Models ◽  
Disjunction Property ◽  
Completeness Proof ◽  
New Model ◽  
Continuity Principle ◽  
Countably Infinite

In this paper we will do some model theory with respect to the models, defined in [7] and, as in [7], we will work again in intuitionistic metamathematics.In this paper we will only consider models M = ‹S, TM›, where S is one fixed spreadlaw for all models M, namely the universal spreadlaw. That we can restrict ourselves to this class of models is a consequence of the completeness proof, which is sketched in [7, §3].The main tools in this paper will be two model-constructions:(i) In §1 we will consider, under a certain condition C(M0, M, s), the construction of a model R(M0, M, s) from two models M0 and M with respect to the finite sequence s.(ii) In §2 we will construct from an infinite sequence M0, M1, M2, … of models a new model Σi∈INMi.Syntactic proofs of the disjunction property and the explicit definability theorem are well known.C. Smorynski [8] gave semantic proofs of these theorems with respect to Kripke models, however using classical metamathematics. In §1 we will give intuitionistically correct, semantic proofs with respect to the models, defined in [7] using Brouwer's continuity principle.Let W be the fan of all models (see [7, Theorem 2.7]) and let Γ be a countably infinite sequence of sentences.

OCCUPATION TIMES OF BROWNIAN SEGMENTS AND THE σ-FINITE WIENER MEASURE

2005 ◽  
Vol 08 (02) ◽  
pp. 199-213
Author(s):  
TOMASZ BOJDECKI ◽  
LUIS G. GOROSTIZA
Keyword(s):  
Brownian Motion ◽  
Polish Space ◽  
Wiener Measure ◽  
Asymptotic Result ◽  
Main Role ◽  
Occupation Times ◽  
Borel Sets ◽  
New Information ◽  
Strengthened Form ◽  
Consecutive Time

We give an asymptotic result for the occupation of Borel sets of functions by the segments of recurrent Brownian motion on consecutive time intervals [n, n +1], n =0, 1, 2, …. This result provides new information on the behavior of Brownian motion, which is illustrated by examples. A formulation in terms of weak convergence of random measures on Polish space is also given. The proof is based on (a strengthened form of) the Darling–Kac occupation time theorem for Markov chains, and our result can be viewed as a "trajectorial" extension of that theorem. The main role in the occupation limit for Brownian segments is played by the σ-finite Wiener measure, which first appeared in a different context. An extension for segments of symmetric α-stable Lévy processes is also given.

Sequential discreteness and clopen-I-Boolean classes

1987 ◽  
Vol 52 (1) ◽  
pp. 232-242
Author(s):  
Randall Dougherty
Keyword(s):  
Final Section ◽  
Baire Space ◽  
Boolean Operations ◽  
Index Set ◽  
Borel Sets ◽  
Borel Hierarchy ◽  
Wadge Reducibility ◽  
Analytic Sets ◽  
Converse Results

Kantorovich and Livenson [6] initiated the study of infinitary Boolean operations applied to the subsets of the Baire space and related spaces. It turns out that a number of interesting collections of subsets of the Baire space, such as the collection of Borel sets of a given type (e.g. the Fσ sets) or the collection of analytic sets, can be expressed as the range of an ω-ary Boolean operation applied to all possible ω-sequences of clopen sets. (Such collections are called clopen-ω-Boolean.) More recently, the ranges of I-ary Boolean operations for uncountable I have been considered; specific questions include whether the collection of Borel sets, or the collection of sets at finite levels in the Borel hierarchy, is clopen-I-Boolean.The main purpose of this paper is to give a characterization of those collections of subsets of the Baire space (or similar spaces) that are clopen-I-Boolean for some I. The Baire space version can be stated as follows: a collection of subsets of the Baire space is clopen-I-Boolean for some I iff it is nonempty and closed downward and σ-directed upward under Wadge reducibility, and in this case we may take I = ω2. The basic method of proof is to use discrete subsets of spaces of the form K2 to put a number of smaller clopen-I-Boolean classes together to form a large one. The final section of the paper gives converse results indicating that, at least in some cases, ω2 cannot be replaced by a smaller index set.

Borel complexity of isomorphism between quotient Boolean algebras

2008 ◽  
Vol 73 (4) ◽  
pp. 1328-1340
Author(s):  
Su Gao ◽  
Michael Ray Oliver
Keyword(s):  
Equivalence Relation ◽  
Boolean Algebras ◽  
Equivalence Relations ◽  
Borel Set ◽  
Borel Sets ◽  
Opposite Case ◽  
Borel Complexity ◽  
Borel Ideal ◽  
The One ◽  
Ergodic Equivalence Relations

In response to a question of Farah, “How many Boolean algebras are there?” [Far04], one of us (Oliver) proved that there are continuum-many nonisomorphic Boolean algebras of the form with I a Borel ideal on the natural numbers, and in fact that this result could be improved simultaneously in two directions:(i) “Borel ideal” may be improved to “analytic P-ideal”(ii) “continuum-many” may be improved to “E0-many”; that is, E0 is Borel reducible to the isomorphism relation on quotients by analytic P-ideals.See [Oli04].In [AdKechOO], Adams and Kechris showed that the relation of equality on Borel sets (and therefore, any Borel equivalence relation whatsoever) is Borel reducible to the equivalence relation of Borel bireducibility. (In somewhat finer terms, they showed that the partial order of inclusion on Borel sets is Borel reducible to the quasi-order of Borel reducibility.) Their technique was to find a collection of, in some sense, strongly mutually ergodic equivalence relations, indexed by reals, and then assign to each Borel set B a sort of “direct sum” of the equivalence relations corresponding to the reals in B. Then if B1, ⊆ B2 it was easy to see that the equivalence relation thus induced by B1 was Borel reducible to the one induced by B2, whereas in the opposite case, taking x to be some element of B / B2, it was possible to show that the equivalence relation corresponding to x, which was part of the equivalence relation induced by B1, was not Borel reducible to the equivalence relation corresponding to B2.

Sign in / Sign up

Export Citation Format

Share Document