| ▲ | deepsun an hour ago | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
There is, or rather are, fully recognized axiomatic foundations. You are free to choose one you like. Of the most popular ones is ZFC or ZF, but there are others (some lead to the same results some not). The main criteria for popularity is how useful it is. You can even make your own axiomatic where 2+2=5, but it would be useless. You probably heard about Goedel Incompleteness -- the proof that the the axiomatic itself cannot be proven, like using ZFC to prove ZFC, but that's another topic. It would be fun to play with this Anthropic/Lean formalization under different axiomatics. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▲ | andriy_koval 43 minutes ago | parent [-] | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
> Goedel Incompleteness -- the proof that the the axiomatic itself cannot be proven, like using ZFC to prove ZFC, but that's another topic. Godel theorems are for systems with basic arithmetic, zfc doesn't include arithmetic, thus are not object of Godel theorems. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||