Tarski's Undefinability Theorem and first-order arithmetic
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2010
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911159825727488 |
|---|---|
| author | Boyce, Stephen |
| author_facet | Boyce, Stephen |
| contents | This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of these proofs shows however that they fail on the grounds that the result that is to be established is assumed as a premise. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1003_4483 |
| institution | arXiv |
| publishDate | 2010 |
| record_format | arxiv |
| spellingShingle | Tarski's Undefinability Theorem and first-order arithmetic Boyce, Stephen Logic 03F30, 03B10 This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of these proofs shows however that they fail on the grounds that the result that is to be established is assumed as a premise. |
| title | Tarski's Undefinability Theorem and first-order arithmetic |
| topic | Logic 03F30, 03B10 |
| url | https://arxiv.org/abs/1003.4483 |