Abstract
Among the main theorems obtained in mathematical logic in this century are the so called limitation theorems, i.e., the Löwenheim-Skolem theorem on the cardinality of models of first-order theories, Gödel’s incompleteness theorems and Tarski’s theorem on the undefinability of truth. Problems connected with the latter are the subject of this paper. In Section 1 we shall consider Tarski’s theorem. In particular the original formulation of it as well as some specifications will be provided. Next various meanings of the notion of a satisfaction predicate will be studied. In Section 2 the problem of definability of the notion of truth, in particular of the notion of truth for the language of Peano arithmetic PA, will be discussed. It will be explicitly shown that the notion of satisfaction (and consequently also the notion of truth) for the language of PA can be defined in a certain weak fragment of the second order arithmetic. Finally the axiomatic characterization of satisfaction and truth (i.e., the notion of a satisfaction class) as well and its mathematical and philosophical meaning will be discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kurt Gödel, “Über formal unentscheidbare Sätze der ‘Principia Mathematica’ und verwandter Systeme. I”, in: Monatsheftefir Mathematik und Physik 38, 1931, pp. 173–198. Reprinted with English translation “On Formally Undecidable Propositions of Principia Mathematica and Related Systems” in: K. Gödel, Collected Works,vol. I, ed. by Feferman, S. et al.,New York: Oxford University Press, and Oxford: Clarendon Press, 1986, pp. 144–195.
Petr Hajek and Pavel Pudlk, Metamathematics of First-Order Arithmetic, Berlin-Heidelberg-New York: Springer-Verlag 1993.
Richard Kaye, Models of Peano Arithmetic, Oxford: Clarendon Press 1991.
Roman Kossak, “A Note on Satisfaction Classes”, in: Notre Dame Journal of Formal Logic 26, 1985, pp. 1–8.
Henryk Kodarski, “Full Satisfaction Classes: A Survey”, in: Notre Dame Journal of Formal Logic 32, 1991, pp. 573–579.
Stanislaw Krajewski, “Non-Standard Satisfaction Classes”, in: W. Marek, M. Srebmy, A. Zarach (Eds.), Set Theory and Hierarchy Theory, Proc. Bierutowice Conf. 1975, Lecture Notes in Mathematics 537, Berlin-Heidelberg-New York: Springer Verlag 1976, pp. 121–144.
Elliott Mendelson, Introduction to Mathematical Logic, Princeton-Toronto-New York-London: D. Van Nostrand Company, Inc. 1964.
Andrzej Mostowski, “A Classification of Logical Systems”, in: Studia Philosophica 4, 1951, pp. 237–274.
Roman Murawski, “Satisfaction Classes — A Survey”, in: Roman Murawski and Jerzy Pogonowski (Eds.), Euphony and Logos,Amsterdam-Atlanta, GA: Editions Rodopi, to appear.
Roman Murawski, Recursive Functions and Metamathematics,to appear.
Roman Murawski, “Undefinability of Truth. The Problem of the Priority: Tarski vs. Gödel”, in: History and Philosophy of Logic,1997, pp.259–281.
Abraham Robinson, “On Languages Based on Nonstandard Arithmetic”, in: Nagoya Mathematical Journal 22, 1963, pp. 83–107.
Hartley Rogers, Jr., Theory of Recursive Functions and Effective Computability, New York-St.Luis-San Francisco-Toronto-London-Sydney: McGraw-Hill 1967.
Joseph R. Shoenfield, Mathematical Logic, Reading, Mass.: Addison-Wesley 1967.
Alfred Tarski, Pojgcie prawdy w jgzykach nauk dedukcyjnych (The Notion of Truth in Languages of Deductive Sciences), Warszawa: Nakladem Towarzystwa Naukowego Warszawskiego 1933.
Alfred Tarski, “Der Wahrheitsbegriff in den formalisierten Sprachen”, in: Studia Philosophica 1, 1936, pp. 261–405 (offprints dated 1935 ).
Alfred Tarski, “The Concept of Truth in Formalized Languages”, in: Logic, Semantics, Metamathematics. Papers From 1923 To 1938, Oxford: Clarendon Press 1965, pp. 152–278.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Murawski, R. (1999). Undefinability vs. Definability of Satisfaction and Truth. In: Woleński, J., Köhler, E. (eds) Alfred Tarski and the Vienna Circle. Vienna Circle Institute Yearbook [1998], vol 6. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0689-6_17
Download citation
DOI: https://doi.org/10.1007/978-94-017-0689-6_17
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5161-5
Online ISBN: 978-94-017-0689-6
eBook Packages: Springer Book Archive