Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Results tagged with descriptive-set-theory
Search options answers only
not deleted
user 6085
Descriptive Set Theory is the study of definable subsets of Polish spaces, where definable is taken to mean from the Borel or projective hierarchies. Other topics include infinite games and determinacy, definable equivalence relations and Borel reductions between them, Polish groups, and effective descriptive set theory.
19
votes
Accepted
Perfect set property for projective hierarchy
Analytic sets have the perfect set property, provable in, say, ZF+DC. This goes back to Suslin, and is discussed in Kanamori's book "The higher infinite" (Around section 12).
Large cardinals imply tha …
12
votes
Accepted
Does Turing determinacy imply full determinacy?
This is open. In $L(\mathbb R)$ the answer is yes. Hugh has several proofs of this, and it remains one of the few unpublished results in the area. The latest version of the statement (that I know of) …
10
votes
Accepted
Does determinacy in $L(\mathbb{R})$ implies projective determinacy (in $V$)?
Suppose $M$ is an inner model (of $\mathsf{ZF}$) with the same reals as $V$, and let $A\subseteq \mathbb R$ be a set of reals in $M$. Suppose further that $A$ is determined in $M$. Under these assumpt …
13
votes
Accepted
Conflating reals and sets of countable ordinals "nicely"
The technique of almost disjoint forcing was introduced in
MR0289291 (44 #6482). Jensen, R. B.; Solovay, R. M. Some
applications of almost disjoint sets. In Mathematical Logic and
Foundations …
13
votes
Accepted
Woodin on Posner-Robinson for the hyperjump and sharp
MR2449474 (2009j:03067) Woodin, W. Hugh. A tt version of the
Posner-Robinson theorem. Computational prospects of infinity. Part II.
Presented talks, 355–392, Lect. Notes Ser. Inst. Math. Sci. N …
4
votes
Accepted
Proof of a soft version of Moschovakis's lemma
The argument you are looking for is given in Kanamori's book, see Theorem 28.15.
For the more nuanced version of the lemma, see section 7D in Moschovakis's descriptive set theory book (particularly …
8
votes
Accepted
Perfect set property implies $\omega_1$ is a limit cardinal in $L$
The usual proof (as in Kanamori's book, section 11) is as follows: Work in $\mathsf{ZF}$. Note first, with Bernstein, that if $\omega_1\le\mathfrak c$, then there is a set of reals without the perfect …
10
votes
Accepted
Failure of Shoenfield's Absoluteness
I'm turning my comment into an answer. With $\Sigma^1_2$ statements we can discuss well-foundedness: A real codes a well-founded model of enough set theory iff it codes a model (which is an arithmetic …
20
votes
Accepted
Consistency strength of projective determinacy (PD)
(2) is false. (1) is true. In fact, $\mathsf{ZFC}+\mathsf{PD}$ (with $\mathsf{PD}$ stated as an axiom schema) implies that for every $n$ there is an inner model of $\mathsf{ZFC}$ with $n$ Woodin cardi …
8
votes
Basis theorem (due to Solovay?)
The result is indeed Solovay's Basis Theorem.
It is a consequence of Moschovakis's Coding Lemma, and sometimes it is referred to as (a version of) the reflection theorem (for example, in section 8 o …
6
votes
Accepted
Models of Determinacy
Certainly, $L(\mathbb R)$ is not a mouse (rather, a weasel) over a countable set, and the only way I see of thinking of it as a mouse and still capturing all the reals is making it a mouse over $\math …
8
votes
Accepted
$\Delta^1_2$-well ordering vs $\Delta^1_3$
Hi Yu,
No, your statement is equiconsistent with $\mathsf{ZFC}$. In
Leo Harrington. Long projective wellorderings, Annals of Mathematical Logic 12 (1977) 1-21, MR0465866 (57 #5752).
it is show …
10
votes
Accepted
Sets of reals and absoluteness
At the projective level, there are nice level by level generalizations, and looking at Steel's paper in the Handbook should give you the proof and the pre-requisites to understand it fully. This is wh …
13
votes
Accepted
Good source for Effective Descriptive Set Theory
A nice source is "Recursive aspects of descriptive set theory" by Mansfield and Galen Weitkamp, as mentioned by Yu in a comment. A problem with it is that it leaves out all the details of admissibilit …
5
votes
Exact consistency-strength of "all projective sets are Ramsey"
Hi David.
This is still open, and I don't know of any strategy that would result in a model with the property for all projective sets but not in a model with the property for all sets in $L({\mathbb …