Constructive Reverse Mathematics — mentioned by nyrikki

Sat, 28 Jun 2025 19:25:33 GMT

To try and help people digging into this, the following helped me. Two lenses for trying to understand this are potentially Chastain's limits on output of a lisp program being more complex than the program itself [1] or Markov's proof that you can't classify manifolds in d>= 4. If you try the latter and need/want to figure out how the Russian school is so different this is helpful [2] IMHO the former gives an intuition why, and the latter explains why IMHO. In ZFC, C actually ends up implying PEM, which is why using constructionism as a form of reverse math helped it click for me . This is…

Paper and discussion history. A mention is not an endorsement.

Constructive Reverse Mathematics · HackerPapers discussions

Constructive Reverse Mathematics — mentioned by nyrikki