› added 2 weeks ago
8
TIL that Robinson arithmetic is a system of mathematics that is so weak that it can't prove that every number is even or odd. But it's still strong enough to represent all computable functions and is subject to Godel's incompleteness theorems.