Skip to main content
Log in

The Concept of Truth in a Finite Universe

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  • Bell, J. and Machover, M. (1977): A Course in Mathematical Logic, Elsevier, Amsterdam.

    Google Scholar 

  • Davis, M., Putnam, H. and Robinson, J. (1961): The decision problem for exponential diophantine equations, Ann. of Math. (2) 74(3), 425-436.

    Google Scholar 

  • Ebbinghaus, H.-D. and Flum, J. (1995): Finite Model Theory, Springer, Berlin.

    Google Scholar 

  • 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.

    Google Scholar 

  • Grohe, M. (1996): Some remarks on finite Löwenheim-Skolem Theorems, Math. Logic Quart. 42, 569-571.

    Google Scholar 

  • Gödel, K. (1931): Ñber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monats. Math. Phys. 38, 173-198.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.)

    Google Scholar 

  • Matiyasevich, Y. (1993): Hilbert's Tenth Problem, MIT Press, Cambridge, Mass.

    Google Scholar 

  • Mostowski, A. (1962): Representability of sets in formal systems, Proc. Symp. Pure Appl. Math. 5, 29-49.

    Google Scholar 

  • Mostowski, A. (1965): Thirty Years of Foudational Studies, Acta Philosophica Fennica, Fasc. XVII, Societas Philosophica Fennica, Helsinki.

    Google Scholar 

  • Murawski, R. (1998): Undefinability of truth. The problem of priority: Tarski vs. Gödel, History and Philosophy of Logic 19, 153-160.

    Google Scholar 

  • Smorynski, C. (1991): Logical Number Theory I, Springer-Verlag, Berlin.

    Google Scholar 

  • Smullyan, R. (1961): Theory of Formal Systems, Princeton University Press, Princeton.

    Google Scholar 

  • Smullyan, R. (1992): Gödel's Incompleteness Theorems, Oxford University Press, Oxford.

    Google Scholar 

  • Soames, S. (1998): Understanding Truth, Oxford University Press, New York.

    Google Scholar 

  • 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.)

    Google Scholar 

  • Tarski, A. (1969): Truth and proof, Scientific American 220(6), 63-77.

    Google Scholar 

  • Tarski, A., Mostowski, A. and Robinson, R. M. (1953): Undecidable Theories, North-Holland, Amsterdam.

    Google Scholar 

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026542526897

Navigation