Undecidability without arithmetization (Q1780896)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability without arithmetization |
scientific article |
Statements
Undecidability without arithmetization (English)
0 references
14 June 2005
0 references
The author gives a new natural and transparent proof of the undecidability of first-order predicate calculus which does not use natural numbers. Instead of arithmetic, Tarski's theory of concatenation is used.
0 references
decidability
0 references
discernibility
0 references
concatenation
0 references
representability
0 references
arithmetization
0 references
Kurt Gödel
0 references
Alfred Tarski
0 references
