Troubles with (the concept of) truth in mathematics

Roman Murawski

doi:10.12775/LLP.2006.017

Authors

Roman Murawski Adam Mickiewicz University, Poznań

DOI:

https://doi.org/10.12775/LLP.2006.017

Keywords

truth, satisfaction, satisfaction class, nonstandard model, Peano arithmetic, second-order arithmetic, omega-logic, transfinite induction

Abstract

In the paper the problem of definability and undefinability of the concept of satisfaction and truth is considered. Connections between satisfaction and truth on the one hand and consistency of certain systems of omega-logic and transfinite induction on the other are indicated.

Author Biography

Roman Murawski, Adam Mickiewicz University, Poznań

Faculty of Mathematics and Comp. Sci.

References

Black, M., 1948, “The semantic definition of truth”, Analysis 8.

Feferman S., 1962, “Transfinite recursive progressions of axiomatic theories”, Journal of Symbolic Logic 27, 259–316.

Gaifman H., 2004, “Non-standard models in a broader perspective”, in: A. Enayat and R. Kossak (eds.), Nonstandard Models of Arithmetic and Set Theory, Contemporary Mathematics vol. 361, American Mathematical Society, Providence, Rhode Island, 1–22.

Hájek P. and P. Pudlák, 1993, Metamathematics of First-Order Arithmetic, Springer-Verlag, Berlin–Heidelberg–New York.

Kaye R., 1991, Models of Peano Arithmetic, Clarendon Press, Oxford.

Kotlarski, H., 1986, “Bounded induction and satisfaction classes”, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 32, 531–544.

Kotlarski H. and Z. Ratajczyk, 1990a, “Inductive full satisfaction classes”, Annals of Pure and Applied Logic 47, 199–223.

Kotlarski H. and Z. Ratajczyk, 1990b, “More on induction in the language with a full satisfaction class”, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36, 441–454.

Mackie J.L., 1973, Truth, Probability and Paradox, Oxford University Press, Oxford.

Mendelson E., 1964, Introduction to Mathematical Logic, D. Van Nostrand Company, Inc., Princeton-Toronto-New York-London.

Mostowski A., 1951, “A Classification of logical systems”, Studia Philosophica 4, 237–274.

Murawski R., 1998, “Undefinability of truth. The problem of priority: Tarski vs Gödel”, History and Philosophy of Logic 19, 153–160.

Murawski R., 1999a, “Undefinability vs. definability of satisfaction and truth”, in: J. Woleński and E. Köhler (eds.), Alfred Tarski and the Vienna Circle, Kluwer Academic Publishers, Dordrecht–Boston–London, 203–215.

Murawski R., 1999b, Recursive Functions and Metamathematics, Kluwer Academic Publishers, Dordrecht–Boston–London.

Niebergall, K.-G., 1996, Zur Metamathematik nichtaxiomatisierbarer Theorien, Centrum für Informations- und Sprachverarbeitung Ludwig-Maximilians-Universität München, Bericht 96–87.

Rogers H., Jr., 1967, Theory of Recursive Functions and Effective Computability, Mc-Graw Hill, New York–St. Luis–San Francisco–Toronto–London–Sydney.

Shoenfield J.R., 1967, Mathematical Logic, Addison-Wesley, Reading, Mass.

Tarski A., 1933, Pojęcie prawdy w językach nauk dedukcyjnych (The Notion of Truth in Languages of Deductive Sciences), Nakładem Towarzystwa Naukowego Warszawskiego, Warszawa.

Tarski A., 1944, “The semantic conception of truth”, Philosophy and Phenomenological Research 4, 341–375.

Tarski A., 1965, “The concept of truth in formalized languages”, in: Logic, Semantics, Metamathematics. Papers From 1923 To 1938, Clarendon Press, Oxford, pp. 152–278.

Woleński, J., 1991, “Gödel, Tarski and the undefinability of truth”, in: Yearbook 1991 of the Kurt Gödel Society (Jahrbuch 1991 der Kurt-Gödel-Gesellschaft), Wien, pp. 97–108. Reprinted in: J. Woleński, Essays in the History of Logic and Logical Philosophy, Jagiellonian University Press, Kraków 1999, pp. 134–138.