The Tarski T-Schema is a tautology (literally)

• Autores: Edward N. Zalta
• Localización: Analysis, ISSN-e 1467-8284, Vol. 74, Nº. 1, 2014, págs. 5-11
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • The Tarski T-Schema has a propositional version. If we use ϕ as a metavariable for formulas and use terms of the form that-ϕ to denote propositions, then the propositional version of the T-Schema is: that-ϕ is true if and only if ϕ. For example, that Cameron is Prime Minister is true if and only if Cameron is Prime Minister. If that-ϕ is represented formally as [λ ϕ], then the T-Schema can be represented as the 0-place case of λ-Conversion. If we interpret [λ…] as a truth-functional context, then using traditional logical techniques, one can prove that the propositional version of the T-Schema is a tautology, literally. Given how well-accepted these logical techniques are, we conclude that the T-Schema, in at least one of its forms, is a not just a logical truth but a tautology at that.