Erdős Problem 1219 to Tao's Optimization Constant 14…
- Erdős Problem 1219
- Busy Beaver
- Tarski's exponential function problem
- Vaught conjecture
- Decidability of reachability for branching vector addition systems
- Complete disjoint NP pairs
- Pudlák's conjectures on incompleteness in the finite domain
- Shelah-Spencer's Zero-One Law for Sparse Random Graphs
- Boxdot Conjecture
- Tao's Optimization Constant 14 / Smallest \(n\) for which the value of \(BB(n)\) is undecidable
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.