- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Undefinability of truth and nonstandard models
Annals of Pure and Applied Logic 126 (1-3):115-123 (2004)
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 arithmeticAuthor's Profile
Other Versions
No versions found
My notes
Similar books and articles
Tarski’s Undefinability Theorem and the Diagonal Lemma.Saeed Salehi - 2022 - Logic Journal of the IGPL 30 (3):489-498.
A Theory of Truth: The Liar Paradox and Tarski's Undefinability Theorem.Bradley Harris Dowden - 1979 - Dissertation, Stanford University
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.
Tarski’s Theory of Truth and a Programme for Semantics.Krystyna Misiuna - 1996 - Dialogue and Universalism 6 (1):117-124.
Undefinability of truth. the problem of priority:tarski vs gödel.Roman Murawski - 1998 - History and Philosophy of Logic 19 (3):153-160.
Self‐Reference and T arski's Theorem.Hartry Field - 2008 - In Saving truth from paradox. New York: Oxford University Press. pp. 23-41.
Analytics
Added to PP
2014-01-16
Downloads
89 (#610,445)
6 months
15 (#807,222)
2014-01-16
Downloads
89 (#610,445)
6 months
15 (#807,222)
Historical graph of downloads
Author's Profile
Citations of this work
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.
References found in this work
Full satisfaction classes: a survey.Henryk Kotlarski - 1991 - Notre Dame Journal of Formal Logic 32 (4):573-579.
Solomon Feferman. Some applications of the notions of forcing and generic sets. The theory of models, Proceedings of the 1963 International Symposium at Berkeley, edited by J. W. Addison, Leon Henkin, and Alfred Tarski, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 89–95. - Solomon Feferman. Some applications of the notions of forcing and generic sets. Fundamenta mathematicae, vol. 56 no. 3, pp. 325–345.James E. Baumgartner - 1972 - Journal of Symbolic Logic 37 (3):612-613.
Discernible elements in models for peano arithmetic.Andrzej Ehrenfeucht - 1973 - Journal of Symbolic Logic 38 (2):291-292.
Minimal satisfaction classes with an application to rigid models of Peano arithmetic.Roman Kossak & James H. Schmerl - 1991 - Notre Dame Journal of Formal Logic 32 (3):392-398.
A certain class of models of peano arithmetic.Roman Kossak - 1983 - Journal of Symbolic Logic 48 (2):311-320.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation