Undefinability of truth and nonstandard models

Annals of Pure and Applied Logic 126 (1-3):115-123 (2004)
  Copy   BIBTEX

Abstract

We discuss Robinson's model theoretic proof of Tarski's theorem on undefinability of truth. We present two other “diagonal-free” proofs of Tarski's theorem, and we compare undefinability of truth to other forms of undefinability in nonstandard models of arithmetic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Tarski’s Undefinability Theorem and the Diagonal Lemma.Saeed Salehi - 2022 - Logic Journal of the IGPL 30 (3):489-498.
Other Proofs of Old Results.Henryk Kotlarski - 1998 - Mathematical Logic Quarterly 44 (4):474-480.
Undefinability vs. Definability of Satisfaction and Truth.Roman Murawski - 1999 - Vienna Circle Institute Yearbook 6:203-215.
The concept of truth in a finite universe.Panu Raatikainen - 2000 - Journal of Philosophical Logic 29 (6):617-633.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Undefinability of truth. the problem of priority:tarski vs gödel.Roman Murawski - 1998 - History and Philosophy of Logic 19 (3):153-160.
Troubles with (the concept of) truth in mathematics.Roman Murawski - 2006 - Logic and Logical Philosophy 15 (4):285-303.

Analytics

Added to PP
2014-01-16

Downloads
38 (#432,587)

6 months
10 (#308,797)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Semantics and Truth.Jan Woleński - 2019 - Cham, Switzerland: Springer Verlag.
The incompleteness theorems after 70 years.Henryk Kotlarski - 2004 - Annals of Pure and Applied Logic 126 (1-3):125-138.
Tarski’s Undefinability Theorem and the Diagonal Lemma.Saeed Salehi - 2022 - Logic Journal of the IGPL 30 (3):489-498.

Add more citations

References found in this work

Full satisfaction classes: a survey.Henryk Kotlarski - 1991 - Notre Dame Journal of Formal Logic 32 (4):573-579.
Discernible elements in models for peano arithmetic.Andrzej Ehrenfeucht - 1973 - Journal of Symbolic Logic 38 (2):291-292.
On Languages which are Based on Non-Standard Arithmetic.Abraham Robinson - 1969 - Journal of Symbolic Logic 34 (3):516-517.
A certain class of models of peano arithmetic.Roman Kossak - 1983 - Journal of Symbolic Logic 48 (2):311-320.

View all 8 references / Add more references