Posts
Combinatorics
- Uncountable perfect graphs
- On a theorem of Mycielski and Taylor
- Subposets of small dimension
- A partition theorem for finite trees
- Envelope forcing
- What is combinatorial set theory?
- Some Cardinal Arithmetic
Computability Theory
Forcing and Independence Proofs
Mathematical Games
Mathematical Philosophy
- Santa Exists!
- Counting Birds...
- Diaconescu's Theorem
- Back to Cantor?
- Arithmetical consequences of the set-theoretic multiverse
- Homotopy Type Theory
Model Theory
Proof Theory
Reverse Mathematics
- On computing complex square roots
- Classically valid theorems of intuitionistic analysis
- Subposets of small dimension
- Generalized separation principles
- Envelope forcing
- Scheming schemes...
- Towsner's stable forcing
Set Theory
- Paris-Harrington and Typing
- Complete subspaces of a metric space
- Santa Exists!
- Uncountable perfect graphs
- On a theorem of Mycielski and Taylor
- Subposets of small dimension
- Diaconescu's Theorem
- Scheming schemes...
- Back to Cantor?
- Arithmetical consequences of the set-theoretic multiverse
- What is combinatorial set theory?
- Some Cardinal Arithmetic