### Boole’s Rings

- Partitioning a reflecting stationary set February 15, 2019 Assaf Rinot
- 4th Arctic Set Theory Workshop, January 2019 February 15, 2019 Assaf Rinot
- The Core Model Induction and Other Inner Model Theoretic Tools Rutgers - Tutorial: HOD Computations February 8, 2019 Sandra Müller
- Potentialism and implicit actualism in the foundations of mathematics, Jowett Society lecture, Oxford, February 2019 January 26, 2019 Joel David Hamkins
- Towards a general method for accessible content trees or: deep aria-labels for equations revisited January 13, 2019 Peter Krautzberger

### Comments on Boole’s Rings

- Comment on Math for nine-year-olds: fold, punch and cut for symmetry! by Joel David Hamkins February 8, 2019 Comments for Joel David Hamkins
- Comment on Inner-model reflection principles by Inner-model reflection principles | A kind of library February 2, 2019 Comments for Joel David Hamkins
- Comment on Math for nine-year-olds: fold, punch and cut for symmetry! by Joseph O'Rourke January 30, 2019 Comments for Joel David Hamkins
- Comment on Math for nine-year-olds: fold, punch and cut for symmetry! by 10 fun geometry ideas to share with kids – inspired by a Jordan Ellenberg tweet – Mike's Math Page January 25, 2019 Comments for Joel David Hamkins
- Comment on A remark on Schimmerling’s question by Ari Brodsky January 24, 2019 Comments for Assaf Rinot

# Category Archives: Results worth knowing

## An example with Dedekind cuts

In this post, I will briefly describe an example in computability theory that is well known, but not easy to find in the literature. It gives one reason why Dedekind cuts are difficult to work with computationally. Theorem. There is … Continue reading

Posted in Musings, Results worth knowing
Leave a comment

## Filter quantifiers

I have been supervising an undergraduate student in an independent study in topology this semester. We have just finished the Stone–Čech compactification, and the semester is ending, so I want to end with an ultrafilter based proof of Hindman’s theorem. … Continue reading

Posted in Results worth knowing
4 Comments

## 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