Undecidability without arithmetization (Q1780896)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Undecidability without arithmetization |
scientific article; zbMATH DE number 2175877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undecidability without arithmetization |
scientific article; zbMATH DE number 2175877 |
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
0.8214762806892395
0 references
0.8153741359710693
0 references
0.7998725175857544
0 references
0.7577642202377319
0 references
