tarski's undefinability theorem
Tarski's undefinability theorem states that within a formal mathematical system, it is impossible to define the truth of all statements about arithmetic in terms of arithmetic itself.
Requires login.
Related Concepts (11)
Similar Concepts
- completeness theorem
- darboux's theorem
- fermat's last theorem
- fermat's theorem
- godel's incompleteness theorem
- no-hair theorem
- noether's theorem
- stability theorems
- tautological reasoning
- the turing test
- turing test
- turing's halting problem
- tychonoff's theorem
- uncertainty principle
- uniformization theorem