### Boole’s Rings

- Paul K. Gorbow, PhD 2018, University of Gothenburg June 16, 2018 Joel David Hamkins
- Definable Models Without Choice June 7, 2018 Asaf Karagila
- KNAW Academy Colloquium on Generalised Baire Spaces - Lebesgue’s Density Theorem for tree forcing ideals June 7, 2018 [“Sandra Müller”]
- (with R. Carroy and A. Medini) Every zero-dimensional homogeneous space is strongly homogeneous under determinacy May 31, 2018 [“Sandra Müller”]
- Booles' Rings is dead, long live Booles' Rings! May 31, 2018 Peter Krautzberger

### Comments on Boole’s Rings

- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Thomas Benjamin June 12, 2018 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Thomas Benjamin June 8, 2018 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Joel David Hamkins June 8, 2018 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Thomas Benjamin June 8, 2018 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Joel David Hamkins June 7, 2018 Comments for Joel David Hamkins

# 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