4
votes
0answers
102 views

The (global) theory of Borel equivalence relations

What do we know about the complexity of the theory of Borel equivalence relations, with the Borel reducibility order $\leq_B$? That is, let $\mathcal{B}$ be the set of all Borel equivalence ...
2
votes
0answers
69 views

Countable model theory for $\omega$-stable theories?

This is a bit of a fishing expedition, because I'm not sure what I'm looking for. Very vaguely stated, here's the driving question: What conditions on an $\omega$-stable theory make the class of ...
10
votes
1answer
413 views

Does Turing determinacy imply full determinacy?

The axiom of Turing determinacy is a weakening of the full axiom of determinacy, $AD$, in which only games with payoff sets which are $\equiv_T$-invariant are demanded to be determined. In "Turing ...
8
votes
2answers
301 views

When is $A$ “$L$-ish” whenever $B$ is “$L$-ish”?

My question is about a kind of relative constructibility in set theory. Fix a countable transitive model $W\models ZFC$ which is much bigger than $L^W$. There is a natural way within $W$ to compare ...
10
votes
1answer
206 views

Higher recursion theory and reverse mathematics: What is to $\Pi^1_1-CA_0$ as $RCA_0$ is to $ACA_0$?

There is an extremely rich and well-understood analogy between "recursively enumerable" and "$\Pi^1_1$" - indeed, this is the starting point of metarecursion theory, and $\alpha$-recursion theory in ...
4
votes
0answers
171 views

$\infty$-Borel Determinacy?

An $\infty$-Borel set is a set $X\subseteq\mathbb{R}$ which has an $\infty$-Borel code - a set $r$ coding the construction of $X$ via open sets, complementation, and well-ordered unions (see ...
14
votes
2answers
448 views

Pathological behavior of Borel sets?

Usually in set theory, Borel sets are much more nicely behaved than arbitrary sets of reals. One reason for this is Borel determinacy, which immediately yields measurability, Baireness, and the ...
4
votes
1answer
215 views

Perfect set property implies $\omega_1$ is a limit cardinal in $L$

Specker proved in 1957 that if in $V$ every set of real numbers has the perfect set property, than in $L$, $\omega_1^V$ is actually a limit cardinal. The original proof is in German, and I've been ...
5
votes
1answer
214 views

A model of Krivine

In a paper by J.-L. Krivine, Modèles de ZF+AC dans lesquels tout ensemble de réels définissable en termes d'ordinaux est mesurable-Lebesgue [C. R. Acad. Sci. Paris Sér. A-B 269 (1969), A549–A552, ...
9
votes
1answer
184 views

Obtaining a lightface pointclass from a boldface one

Define a pointclass to be: boldface inductive-like if it is $\mathbb{R}$-parameterized, has the scale property, and is closed under $\wedge$, $\vee$, $\forall^\mathbb{R}$, $\exists^\mathbb{R}$, and ...
2
votes
0answers
167 views

How many Dedekind-finite sets can $\mathbb{R}$ be partitioned into?

Building off Asaf Karagila's answer to my previous question (Can $\mathbb{R}$ be partitioned into dedekind-finite sets?) on partitioning $\mathbb{R}$ into strictly Dedekind-finite sets: (1) What ...
-1
votes
1answer
153 views

Algebra generated by a tree [Edit] [closed]

Suppose that $(T,\leq)$ is a partially ordered set, we say $T$ is a tree* if for every $i\in T$, $\{s: s\in T, s\leq t\}$ is a well-founded chain. What I need to know is: Can the algebra ...
8
votes
1answer
239 views

Can $\mathbb{R}$ be partitioned into dedekind-finite sets?

Assuming $ZF$ itself is consistent, it is consistent that there are sets $D$ which are infinite but cannot be placed in bijection with any of their proper subsets; such sets are called "strictly ...
6
votes
1answer
381 views

Is there a suitably generalized Baire property for topological spaces of arbitrary cardinalities?

Is there some suitable generalization to the notion of Baire property for topological spaces of arbitrary cardinalities which satisfies the following condition: The meager sets are sets which are ...
5
votes
1answer
249 views

Failure of Shoenfield's Absoluteness

Shoenfield's absoluteness states that if $M \subseteq N$ are models of $ZF$ and $M \supseteq \omega_1^N$, then every $\Sigma^1_2$ formula with parameters in $M$ is absolute between $M$ and $N$. In ...
9
votes
1answer
243 views

Are there trees for $(\Sigma^2_1)^{\text{uB}}$?

If there is a proper class of Woodin cardinals, then Woodin showed (using stationary towers) that $(\Sigma^2_1)^{\text{uB}}$ statements are generically absolute, where $\text{uB}$ denotes the ...
7
votes
2answers
196 views

Natural $\Pi^1_2$ (or worse) classes of structures?

(To clarify, my interest is mainly lightface, that is, $\Pi^1_2$ instead of $\bf \Pi^1_2$, although it doesn't particularly matter.) This is just an idle curiosity. In logic, I find myself frequently ...
6
votes
1answer
194 views

Is the consistency of $\mathcal{L}_{\infty\omega}$-sentences absolute?

The question is exactly that of the title. Suppose $\varphi\in V$ is an $\mathcal{L}_{\infty\omega}$-sentence, and $W$ is an inner model of $V$ such that $\varphi\in W$. Is the statement ...
9
votes
1answer
154 views

n odd: $\bf\Delta^1_n$ wadge degrees are $< \bf\delta^1_{n+1}$

My adviser is out of town and there is a comment in the Van Wesep paper "wadge degrees and descriptive set theory" that I can't figure out. Work in ZF+AD throughout. As stated in the title, the ...
9
votes
1answer
262 views

Universal $(\Sigma^2_1)^{\text{Hom}_{\mathord{<}\lambda}}$ set

Does anyone know of a reference for the fact that if $\lambda$ is a limit of Woodin cardinals, then the pointclass $(\Sigma^2_1)^{\text{Hom}_{\mathord{<}\lambda}}$ is $\omega$-parameterized? By ...
9
votes
1answer
279 views

Concerning Silver's result

Jack Silver proved that if $x$ is a real so that every $x$-admissible ordinal is a cardinal in $L$, then $0^{\sharp}$ exists. I wonder whether various weaker or stronger versions of Silver's result ...
5
votes
2answers
230 views

Does the boldface class $\Delta^1_2$ have the uniformization property? (assuming $V=L$)

DISCLAIMER: All pointclasses considered here are boldface. Most of the time, when doing descriptive set theory, we want the projective sets to "behave well;" for example, maybe we don't want there to ...
3
votes
1answer
151 views

Is the ideal of compact operators strongly Borel?

Let $H$ be a separable infinite dimensional Hilbert space. Denote by $\mathcal{B}(H)$ the space of bounded operators on $H$, and $\mathcal{K}(H)$ the ideal of compact operators. When endowed with the ...
5
votes
1answer
237 views

Is the equivalence between a $\Sigma^0_1$ and a $\Pi^0_1$ formula defining the same recursive set provable in a sufficiently strong arithmetic ?

Let $A$ be a recursive set. $A$ is recursively enumerable, so $A$ may be defined by a $\Sigma^0_1$ formula, i.e. by $\exists \overrightarrow{a} \phi (\overrightarrow{a}, n)$, where $\phi$ contains no ...
3
votes
2answers
314 views

Cohen algebra (generalization)

Let Bor($X$) = class of all borel subsets of $X$. Cohen algebra is defined as Bor(X) modulo the ideal of meager sets. The Cohen algebra has a combinatorial : it is the unique atomless complete ...
20
votes
0answers
798 views

Godel on recursion-theoretic hierarchies

At the end of his excellent article, "The Emergence of Descriptive Set Theory" (http://math.bu.edu/people/aki/2.pdf), Kanamori writes: "Another mathematical eternal return: Toward the end of his ...
3
votes
1answer
151 views

Complexity of winning strategies for open games (for open player)

If $G\subseteq\omega^{<\omega}$ is a computable clopen game, then $G$ has a winning strategy which is hyperarithmetic $(\Delta^1_1)$, by an inductive ranking process. The key observation here is ...
4
votes
1answer
163 views

When do substructures have computable copies?

Say that a class $\mathcal{C}$ of countable first-order structures in some finite signature has the effective substructure property if $\mathcal{C}$ is closed under isomorphism and whenever $A\in ...
9
votes
1answer
181 views

Ensuring nonempty lightface Borel sets have elements via theories of second-order arithmetic

This question is an outgrowth of this MathSE question: http://math.stackexchange.com/questions/276068/members-of-lightface-borel-sets. A Borel set $X\subseteq 2^\omega$ is a member of the smallest ...
4
votes
1answer
374 views

Definition of HYP in $L_{\omega_1^{CK}}[a]$?

The structure $L_{\omega_1^{CK}}$ consists of only HYP sets (I believe) and HYP in this structure is the same as the actual hyperaritmetic sets. Now if I move to the structure $L_{\omega_1^{CK}}[a]$ ...
6
votes
0answers
167 views

$\omega$-models of $\mathbf{\Sigma^1_1}-DC$ and $\mathbf{\Delta^1_1}-CA$

So what is needed to demonstrate something (say like $L_{\omega_1^{CK}}[a]$ is a $\omega$-models of $\mathbf{\Sigma^1_1}$-$DC$ or $\mathbf{\Delta^1_1}$-$CA$? It's not like I don't understand what the ...
5
votes
0answers
331 views

Proof of “AD + every set of reals is Suslin” implies AD$_\mathbb{R}$

Could someone point me toward a proof that "ZF + AD + every set of reals is Suslin" (+ $\mathsf{DC}\_\mathbb{R}$?) implies $\mathsf{AD}\_\mathbb{R}$, either with a reference or a hint? I am ...
6
votes
1answer
271 views

Determinacy and definable ultrafilters

It is a simple consequence of AD that there are no non-principal ultrafilters on $\omega$: for $U$ an ultrafilter on $\omega$, consider the game $G_U$ where players I and II play natural numbers $x_0$ ...
10
votes
1answer
223 views

Which forcings preserve (some) determinacy?

The question is exactly as in the title. I'm interested in general in all questions of the form "which forcings preserve property P?" for any P, but determinacy assumptions occupy a special place in ...
5
votes
0answers
194 views

Infinity-Borel sets in ZFC

The notion of an $\infty$-Borel set of reals is useful in the study of AD. Under ZFC it becomes trivial: every set of reals is $\infty$-Borel. However, the notion of an $\infty$-Borel code is still ...
9
votes
0answers
461 views

Existence (or non) of “definable” ultrafilters

This is a question which I suspect has an absurdly easy answer, but I'm not seeing it. Let $\langle\cdot,\cdot\rangle:\omega^2\rightarrow\omega$ be your favorite pairing map (for me, this is the ...
9
votes
1answer
437 views

Constructing an injective reduction of equivalence relations

[Metastuff: I asked this question in a slightly different way on mathSE last week, and it didn't go anywhere, which is why I am asking here. I added the DST tag because it's basically a problem about ...
5
votes
1answer
202 views

Companion of the pointclass of inductive sets

This question is about the notion of a companion for a Spector class, as defined in Moschovakis's book Elementary Induction on Abstract Structures. I am interested in Spector classes on $\mathbb{R}$, ...
3
votes
1answer
209 views

sigma-algebra generated by OD sets

Assume $V=L(\mathbb{R})$ and the Axiom of Determinacy. Is every set of reals generated by ordinal-definable sets of reals under the operations of countable union and intersection? The class of sets ...
6
votes
2answers
306 views

Weakly homogeneous trees under AD

If AD$_\mathbb{R}$ holds and $\kappa < \Theta$ then every tree $T$ on $\kappa$ is weakly homogeneous (Martin–Woodin, "Weakly homogeneous trees.") I recall hearing that the hypothesis can be ...
5
votes
0answers
322 views

Sets of reals amenable to each L[x]

If $A$ is a set of reals such that $A \cap L[x] \in L[x]$ for each real $x$, is there a real $z$ such that $A \cap L[x] \in OD_z^{L[x]}$ for a cone of $x$? This can be proved under the Axiom of ...
0
votes
1answer
176 views

Trees on $\omega$

I am going to give a construction of a tree on $\omega$ that at first appears as though it is well founded. However, this tree cannot be well-founded because, using the rank function on finite ...
6
votes
3answers
640 views

About the axiom of choice, the fundamental theorem of algebra, and real numbers

About fundamental theorem of algebra, there is a large collection different demonstrations. I ask: is there some proof that avoids AC (choice axiom)? In a general topos (with natural number object) ...
3
votes
1answer
218 views

Indeterminacy of long games

Hello, all, Several months ago I sat in on a seminar on AD+, which was incredibly wonderful even though I could barely follow it at all. AD+ is a technical variant of AD, the axiom of determinacy, ...
11
votes
1answer
428 views

How badly does compactness fail in $\mathcal{L}_{\omega_1\omega}$?

I would like to get a better idea of how badly compactness fails in $\mathcal{L}_{\omega_1\omega}$. Let $\Gamma$ be an arbitrary set of sentences from $\mathcal{L}_{\omega_1\omega}$. Let the ...
14
votes
2answers
827 views

Decomposing $\mathbf{\Pi}^1_1$ sets into closed sets

It is well known that every $\mathbf{\Pi}^1_1$-set is a union of $\aleph_1$-many Borel sets. I wonder whether it can be improved under certain reasonable set theory axioms assumption. For example, ...
2
votes
0answers
131 views

Unbounded Class of Orbit Equivalence Relations

In their paper titled "The Classification of Hypersmooth Borel Equivalence Relations" Alexander Kechris and Alain Louveau quote the following (Theorem 5.2 in the article) as "Harrington, unpublished": ...
5
votes
0answers
556 views

ZFC+``every analytical set is measurable"

I know that "ZFC+the existence of an inaccessible cardinal" is equconsistent to "ZFC + every $\mathbf{\Sigma}^1_3$ set is measurable". Then how about the light face case? Without large cardinal ...
26
votes
0answers
878 views

Concerning the various proofs from the axiom of choice that R^3 admits of surprising geometrical decompositions into circles, skew lines and so on: can we prove in any instance that there are no Borel such decompositions? Or that AC is required?

This question follows up on a comment I made on Joseph O'Rourke's recent question, one of several questions here on mathoverflow concerning surprising geometric partitions of space using the axiom of ...
5
votes
1answer
487 views

Countable admissible ordinals

Jensen claimed that for any finite increasing sequence countable admissible ordinals $\omega= \alpha_0<\alpha_1\cdots <\alpha_n$, there is a real $x$ so that, for each $m\leq n$, $\alpha_m$ is ...