Abstract
The prospects and limitations of defining truth in a finite model in the same language whose truth one is considering are thoroughly examined. It is shown that in contradistinction to Tarskirs undefinability theorem for arithmetic, it is in a definite sense possible in this case to define truth in the very language whose truth is in question.
Similar content being viewed by others
REFERENCES
Bell, J. and Machover, M. (1977): A Course in Mathematical Logic, Elsevier, Amsterdam.
Davis, M., Putnam, H. and Robinson, J. (1961): The decision problem for exponential diophantine equations, Ann. of Math. (2) 74(3), 425-436.
Ebbinghaus, H.-D. and Flum, J. (1995): Finite Model Theory, Springer, Berlin.
Gurevich, Y. (1984): Toward logic tailored for computational complexity, in M. M. Richter et al. (eds.), Computation and Proof Theory, Lecture Notes in Math. 1104, Springer-Verlag, Berlin, pp. 175-216.
Grohe, M. (1996): Some remarks on finite Löwenheim-Skolem Theorems, Math. Logic Quart. 42, 569-571.
Gödel, K. (1931): Ñber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monats. Math. Phys. 38, 173-198.
Gödel, K. (1934): On undecidable propositions of formal mathematical systems, Mimeographed notes, by S. Kleene and J. Rosser, published in M. Davis (ed.), The Undecidable, Raven Press, 1965, pp. 41-81.
Machover, M. (1996): Set Theory, Logic and their Limitations, Cambridge University Press, Cambridge.
Matiyasevich, Y. (1970): Diofantovost' perechislimykh mnozhestv, Dokl. Akad. Nauk SSSR 191(2), 297-282 (Russian). (English translation, “Enumerable sets are Diophantine”, Soviet Math. Dokl. 11(2) (1970), 354-358.)
Matiyasevich, Y. (1993): Hilbert's Tenth Problem, MIT Press, Cambridge, Mass.
Mostowski, A. (1962): Representability of sets in formal systems, Proc. Symp. Pure Appl. Math. 5, 29-49.
Mostowski, A. (1965): Thirty Years of Foudational Studies, Acta Philosophica Fennica, Fasc. XVII, Societas Philosophica Fennica, Helsinki.
Murawski, R. (1998): Undefinability of truth. The problem of priority: Tarski vs. Gödel, History and Philosophy of Logic 19, 153-160.
Smorynski, C. (1991): Logical Number Theory I, Springer-Verlag, Berlin.
Smullyan, R. (1961): Theory of Formal Systems, Princeton University Press, Princeton.
Smullyan, R. (1992): Gödel's Incompleteness Theorems, Oxford University Press, Oxford.
Soames, S. (1998): Understanding Truth, Oxford University Press, New York.
Tarski, A. (1933a): Pojecie prawdy w jezykach dedukcyjnych, Nakladem Towarzystwa Naukowego Warszawskiego, Warszawa. (English translation: “The Concept of Truth in Formalized Languages”, in A. Tarski, Logic, Semantics, Metamathematics: Papers from 1923 to 1938 (edited and translated by J. H. Woodger), Clarendon Press, Oxford, 1956. Page references are to the English translation.)
Tarski, A. (1933b): Einige Betrachtungen über die Begriffe ω-Widerspruchsfreiheit und der ω-Vollständigkeit, Monats. Math. Phys. 40, 97-112. (English translation: “Some observations on the concepts of ω-consistency and ω-completeness”, in A. Tarski, Logic, Semantics, Metamathematics: Papers from 1923 to 1938 (edited and translated by J. H. Woodger), Clarendon Press, Oxford, 1956. Page references are to the English translation.)
Tarski, A. (1969): Truth and proof, Scientific American 220(6), 63-77.
Tarski, A., Mostowski, A. and Robinson, R. M. (1953): Undecidable Theories, North-Holland, Amsterdam.
Trakhtenbrot, B. A. (1950): Nevozmoznost' algorifma dla problemy razresimosti na konecnyh klassah, (“Impossibility of an algorithm for the decision problem in finite classes”), Dokl. Akad. Nauk SSSR 70, 569-572.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Raatikainen, P. The Concept of Truth in a Finite Universe. Journal of Philosophical Logic 29, 617–633 (2000). https://doi.org/10.1023/A:1026542526897
Issue Date:
DOI: https://doi.org/10.1023/A:1026542526897