Boole’s Rings- Consistency strength lower bounds for the proper forcing axiom via the core model induction March 5, 2020 Sandra Müller
- Logic Colloquium Poznan - TBA March 5, 2020 Sandra Müller
- North American Annual Meeting of the ASL - How to obtain lower bounds in set theory March 4, 2020 Sandra Müller
- International Day of Mathematics, Vienna - Das Unbegreifliche verstehen - die Faszination Unendlichkeit March 3, 2020 Sandra Müller
- The real numbers are not interpretable in the complex field February 24, 2020 Joel David Hamkins
- Comments on Boole’s Rings
- Comment on Math for eight-year-olds: graph theory for kids! by graph theory for children - Oxford Blog March 28, 2020 Comments for Joel David Hamkins
- Comment on Math for seven-year-olds: graph coloring, chromatic numbers, and Eulerian paths and circuits by graph theory for children - Oxford Blog March 28, 2020 Comments for Joel David Hamkins
- Comment on Math for kids: fun with orthoprojections! by Marco March 27, 2020 Comments for Joel David Hamkins
- Comment on Set-theoretic geology by A tutorial in set-theoretic geology, London 2011 | Joel David Hamkins March 21, 2020 Comments for Joel David Hamkins
- Comment on The real numbers are not interpretable in the complex field by Joel David Hamkins March 4, 2020 Comments for Joel David Hamkins
Tag Archives: computable analysis
Computable roots of computable functions
Here are several interesting results from computable analysis: Theorem 1. If $f$ is a computable function from $\mathbb{R}$ to $\mathbb{R}$ and $\alpha$ is an isolated root of $f$, then $\alpha$ is computable. Corollary 2. If $p(x)$ is a polynomial over … Continue reading