Let Γ be a collection of relations on the reals and let M be a set of reals. We call M a perfect set basis for Γ if every set in Γ with parameters from M which is not totally included in M contains a perfect subset with code in M. A simple elementary proof is given of the following result (assuming mild regularity conditions on Γ and M): If M is a perfect set basis for Γ, the field of every wellordering in Γ is contained in M. An immediate corollary is Mansfield's Theorem that the existence of a Σ^1_2 wellordering of the reals implies that every real is constructible. Other applications and extensions of the main result are also given
summary:Under Martin's axiom, collapsing of the continuum by Sacks forcing $\Bbb S$ is characterized...
at one is isomorphic to an initial segment of the other, and that the wellorderings can be canonical...
A set X ⊆ 2 ω is a λ ′-set iff for every countable set Y ⊆ 2 ω there exists a Gδ set G such that (X ...
Let Γ be a collection of relations on the reals and let M be a set of reals. We call M a perfect set...
We show that if there is a nonconstructible real, then every perfect set has a nonconstructible elem...
In the paper we prove that axiom CPAgameprism, which follows from the Covering Property Axiom CPA an...
The purpose of this paper is to give a necessary and sufficient condition for a subset of ℵ_1 to be ...
Abstract. We show that the bounded proper forcing axiom BPFA implies that there is a well-ordering o...
Using countable support iterations of S-proper posets, we show that the existence of a ∆13 definable...
AbstractWe show that b=c=ω3 is consistent with the existence of a Δ31-definable wellorder of the rea...
AbstractUsing countable support iterations of S-proper posets, we show that the existence of a Δ31 d...
Understanding the structure of sets of reals is one of the fundamental problems of set theory. Of ...
The tale and the goals The topos of this research can be traced back to 1878 when the mathematician ...
AbstractLet B be the closed term model of the λ-calculus in which terms with the same Böhm tree are ...
Abstract. In this paper, the ordered set of rough sets determined by a quasiorder relation R is inve...
summary:Under Martin's axiom, collapsing of the continuum by Sacks forcing $\Bbb S$ is characterized...
at one is isomorphic to an initial segment of the other, and that the wellorderings can be canonical...
A set X ⊆ 2 ω is a λ ′-set iff for every countable set Y ⊆ 2 ω there exists a Gδ set G such that (X ...
Let Γ be a collection of relations on the reals and let M be a set of reals. We call M a perfect set...
We show that if there is a nonconstructible real, then every perfect set has a nonconstructible elem...
In the paper we prove that axiom CPAgameprism, which follows from the Covering Property Axiom CPA an...
The purpose of this paper is to give a necessary and sufficient condition for a subset of ℵ_1 to be ...
Abstract. We show that the bounded proper forcing axiom BPFA implies that there is a well-ordering o...
Using countable support iterations of S-proper posets, we show that the existence of a ∆13 definable...
AbstractWe show that b=c=ω3 is consistent with the existence of a Δ31-definable wellorder of the rea...
AbstractUsing countable support iterations of S-proper posets, we show that the existence of a Δ31 d...
Understanding the structure of sets of reals is one of the fundamental problems of set theory. Of ...
The tale and the goals The topos of this research can be traced back to 1878 when the mathematician ...
AbstractLet B be the closed term model of the λ-calculus in which terms with the same Böhm tree are ...
Abstract. In this paper, the ordered set of rough sets determined by a quasiorder relation R is inve...
summary:Under Martin's axiom, collapsing of the continuum by Sacks forcing $\Bbb S$ is characterized...
at one is isomorphic to an initial segment of the other, and that the wellorderings can be canonical...
A set X ⊆ 2 ω is a λ ′-set iff for every countable set Y ⊆ 2 ω there exists a Gδ set G such that (X ...