I tried to reconstruct a proof (that I read a day or two ago) that there exists a pair of recursively enumerable but recursively inseparable sets (I think I succeeded).

I did problem 8 in chapter 8 of Spivak’s Calculus.

I did problem 1 in section 13 of Munkres’s Topology. I also started on problem 2 but after I got the hang of it I stopped.

I read some articles on the Tricki related to real analysis. I especially enjoyed this page.

I think I continued reading a bit of Rogers’s computability book.