Skip to main content
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
Search options questions only not deleted user 15002

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.

5 votes
1 answer
288 views

Is the Hilbert cube the countable union of punctiform spaces?

Recall that a (separable) metric space is called punctiform, if all its compact subspaces are zero-dimensional. While "natural" spaces would seem to be punctiform if they already themselves zero-dimen …
31 votes
2 answers
2k views

How (non-)computable is set theory?

Here is a naive outsiders perspective on set theory: A typical set-theoretical result involves constructing new models of set theory from given ones (typically with different theories for the original …
27 votes
1 answer
4k views

Closed balls vs closure of open balls

We work in a separable metric space $(X,d)$. With $\overline{B}(x,r)$ I denote the closed ball around $x$ of radius $r$, and with $cl \ B(x,r)$ I denote the closure of the open ball. Clearly, we alway …
3 votes
1 answer
85 views

Illfounded trees as "retract" of all trees

Definitions: Let $\omega^{<\omega}$ be the set of all finite sequences of natural numbers. For $u, v \in \omega^{<\omega}$, let $u \prec v$ denote that $u$ is a prefix of $v$. We call a subset $T \sub …