824

Answers
votes newest views recent
5
What is the least ordinal than cannot be embedded in $\mathbb{R}^\mathbb{R}$?
13
Order type of the smallest set containing the identity function and closed under exponentiation
15
Is deciding whether a Turing machine *provably* runs forever equivalent to the halting problem?
2
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 ?
5
A question about large real closed fields
11
Does the generalized $\Delta$-system lemma imply some weak version of the GCH?
9
Are the two meanings of “undecidable” related?
3
Validity in Kripke frames whose points are finite or infinite sequences
8
Forcing mildly over a worldly cardinal.
7
The Kunen inconsistency and definable classes
4
Which $\omega_1$-trees are proper?
5
$n$-in-a-row game on $\mathbb{R}^2$
6
Cohen algebra (generalization)
4
L-systems and Sierpinski Triangle
0
A question on cofinite topology.
3
Approximating a function via definable functions II
9
A question about primitive recursive functions
4
existence of equivalence checking algorithm
6
How much of ZFC do I need to construct this cofinal, order-preserving class function?
2
A question about Kunen’s inconsistency theorem
2
“Axiom of global choice”
6
When does $ZFC \vdash\ ‘ ZFC \vdash \varphi\ ’$ imply $ZFC \vdash \varphi$?
4
A Fraïssé class without the strong amalgamation property.
8
$\epsilon$-Formalization of Undecidability of CH
1
Closure-complement-union: countable space, finite seed, infinite family, space unique?
31
How helpful is non-standard analysis?
15
Existence of unknowable algorithms ?
3
Two different products of filters
1
If M is an inner model containing all the reals, might every game in M be determined in V?
7
How to work out a grammar if we know the language?
1 2 3 4 5 … 28 next