Tarski's definition of truth

Tarski's definition of truth
Name	Alfred Tarski
Birth date	1901
Death date	1983
Nationality	Polish-American
Fields	Logic, Mathematics, Philosophy
Known for	Semantic theory of truth

Tarski's definition of truth Alfred Tarski proposed a formal, semantic concept of truth that aimed to explicate the truth predicate for formal languages with mathematical precision. His work connected developments in Set theory, Model theory, Proof theory, Metalogic, and the foundations found in Principia Mathematica, influencing debates involving Bertrand Russell, Kurt Gödel, Ludwig Wittgenstein, and institutions like the University of Warsaw and the Institute for Advanced Study. The definition sought to avoid paradoxes such as those associated with the Liar paradox while aligning with principles used in Hilbert's program and responses to results like Gödel's incompleteness theorems.

Overview and Historical Context

Tarski's contribution emerged amid interactions with figures such as Emil Post, Alfred North Whitehead, David Hilbert, John von Neumann, and Andrei Kolmogorov during the interwar and postwar periods, and was shaped by debates in Vienna Circle-influenced analytic philosophy and the Polish logician community in Lviv. His semantic approach, published in works presented in Warsaw, responded to prior syntactic or correspondence formulations advanced by Gottlob Frege, Edmund Husserl, and critics in Cambridge University Press circles. The context includes controversies exemplified by exchanges involving W. V. O. Quine, Michael Dummett, and later commentators at places like Princeton University and Harvard University.

Formal Definition and Convention T

Tarski formulated a "Convention T" requirement: a materially adequate truth definition must entail biconditionals of the form "'P' is true iff P" for sentences P, exemplified in specific languages by sentences such as '"Snow is white" is true iff snow is white'. The formal account uses tools from First-order logic, Second-order logic, Recursive function theory, and notions from Formal semantics and Satisfaction relation as developed in Model theory and elaborated with set-theoretic resources from Zermelo–Fraenkel set theory. His method defines truth for a formal language L relative to a structure M by recursion on the syntactic construction of formulas, employing concepts paralleling those in Turing machine-based computability and Arithmetization techniques later used in proofs by Kurt Gödel and Stephen Kleene.

Application to Formal Languages

Tarski's schema was applied to axiomatized systems, including fragments of Peano arithmetic, various versions of ZF, and simplified propositional and predicate calculi studied at Massachusetts Institute of Technology and University of California, Berkeley. By constructing truth definitions in higher-order metalanguages, he showed how a truth predicate for an object language can be given without leading to paradox when the metalanguage is richer; this approach interacts with methods used in Model theory and tools from Ultrafilter constructions and Compactness theorem techniques common in advanced logical investigations. Implementations inspired work in Formal verification at institutions such as Bell Labs and influenced semantic frameworks used at Stanford University and University of Oxford.

Semantic vs. Syntactic Conceptions of Truth

Tarski's account is explicitly semantic, contrasting with syntactic or proof-theoretic notions of truth associated with Hilbert-style provability, Gentzen-type derivations, and systems studied by Gerhard Gentzen and Andrey Kolmogorov. Debates about semantic deflationism and correspondence theories involved philosophers including Donald Davidson, Hilary Putnam, Alvin Plantinga, and critics from Analytic philosophy lineages; exchanges occurred in venues like Mind (journal), The Journal of Symbolic Logic, and conferences at The Royal Society. Tarski's emphasis on model-theoretic satisfaction drew responses from Saul Kripke, Michael Dummett, and Krister Segerberg concerning implications for semantic paradoxes and theories of meaning developed in Princeton and Cambridge settings.

Tarski's Undefinability Theorem and Limitations

Tarski established an undefinability result showing that, under natural conditions exemplified in arithmetical systems like Peano arithmetic, a truth predicate for the language cannot be defined within that same language without contradiction—paralleling consequences of the Gödel–Rosser theorem. This limitation links to methods of diagonalization used by Emil Post and Kurt Gödel and informs constraints on self-referential constructions explored at Columbia University and Yale University. The theorem motivates stratified or hierarchical approaches to truth developed by thinkers at Carnegie Mellon University and University of Chicago, and it delineates boundaries for formal semantics in computational implementations at places like Bell Labs and IBM Research.

Influence and Criticism in Philosophy and Logic

Tarski's definition shaped later work by Donald Davidson, Saul Kripke, Hilary Putnam, Michael Dummett, Hartry Field, and Alvin Plantinga, influencing curricula at Princeton University, Harvard University, University of Oxford, and the University of California system. Critics from analytic traditions raised concerns about the reliance on a richer metalanguage, the apparent circularity observed by some in Cambridge (UK) debates, and pragmatic limits highlighted by researchers at RAND Corporation and SRI International. Nonetheless, Tarski's semantic framework remains foundational in fields nurtured at Institute for Advanced Study, St. Petersburg State University, and research centers in Jerusalem and Paris, continuing to inform contemporary discussions in Philosophy of language, Theoretical computer science, and formal approaches developed at ETH Zurich.

Category:Philosophy of language Category:Logic Category:Alfred Tarski