### Boole’s Rings

- Zoom into the classical Laver table fractals February 26, 2017 Joseph Van Name
- Open and clopen determinacy for proper class games, VCU MAMLS April 2017 February 25, 2017 Joel David Hamkins
- Computable quotient presentations of models of arithmetic and set theory, CUNY set theory seminar, March 2017 February 25, 2017 Joel David Hamkins
- Got jobs? February 19, 2017 Asaf Karagila
- 2017 Workshop in Set Theory, Oberwolfach February 19, 2017 Assaf Rinot

### Comments on Boole’s Rings

- Comment on Reflection on the coloring and chromatic numbers by saf February 26, 2017 Comments for Assaf Rinot
- Comment on Open determinacy for class games by Open and clopen determinacy for proper class games, VCU MAMLS April 2017 | Joel David Hamkins February 25, 2017 Comments for Joel David Hamkins
- Comment on All triangles are isosceles by Joel David Hamkins February 14, 2017 Comments for Joel David Hamkins
- Comment on All triangles are isosceles by Daniel Nagase February 13, 2017 Comments for Joel David Hamkins
- Comment on All triangles are isosceles by Robert Lewis February 12, 2017 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