T-schema
The T-schema ("truth schema", not to be confused with "Convention T") is used to check if an inductive definition of truth is valid, which lies at the heart of any realisation of Alfred Tarski's semantic theory of truth. Some authors refer to it as the "Equivalence Schema", a synonym introduced by Michael Dummett.[1]
The T-schema is often expressed in natural language, but it can be formalized in many-sorted predicate logic or modal logic; such a formalisation is called a "T-theory."[citation needed] T-theories form the basis of much fundamental work in philosophical logic, where they are applied in several important controversies in analytic philosophy.
As expressed in semi-natural language (where 'S' is the name of the sentence abbreviated to S): 'S' is true if and only if S.
Example: 'snow is white' is true if and only if snow is white.
The inductive definition
[edit]By using the schema one can give an inductive definition for the truth of compound sentences. Atomic sentences are assigned truth values disquotationally. For example, the sentence "'Snow is white' is true" becomes materially equivalent with the sentence "snow is white", i.e. 'snow is white' is true if and only if snow is white. Said again, a sentence of the form "A" is true if and only if A is true. The truth of more complex sentences is defined in terms of the components of the sentence:
- A sentence of the form "A and B" is true if and only if A is true and B is true
- A sentence of the form "A or B" is true if and only if A is true or B is true
- A sentence of the form "if A then B" is true if and only if A is false or B is true; see material implication.
- A sentence of the form "not A" is true if and only if A is false
- A sentence of the form "for all x, A(x)" is true if and only if, for every possible value of x, A(x) is true.
- A sentence of the form "for some x, A(x)" is true if and only if, for some possible value of x, A(x) is true.
Predicates for truth that meet all of these criteria are called "satisfaction classes", a notion often defined with respect to a fixed language (such as the language of Peano arithmetic); these classes are considered acceptable definitions for the notion of truth.[2]
Natural languages
[edit]Joseph Heath points out that "the analysis of the truth predicate provided by Tarski's Schema T is not capable of handling all occurrences of the truth predicate in natural language. In particular, Schema T treats only "freestanding" uses of the predicate—cases when it is applied to complete sentences."[3] He gives as an "obvious problem" the sentence:
- Everything that Bill believes is true.
Heath argues that analyzing this sentence using T-schema generates the sentence fragment—"everything that Bill believes"—on the righthand side of the logical biconditional.
See also
[edit]References
[edit]- ^ Künne, Wolfgang (2003). Conceptions of truth. Clarendon Press. p. 18. ISBN 978-0-19-928019-3.
- ^ H. Kotlarski, Full Satisfaction Classes: A Survey (1991, Notre Dame Journal of Formal Logic, p.573). Accessed 9 September 2022.
- ^ Heath, Joseph (2001). Communicative action and rational choice. MIT Press. p. 186. ISBN 978-0-262-08291-4.
External links
[edit]- Zalta, Edward N. (ed.). "Tarski's Truth Definitions". Stanford Encyclopedia of Philosophy.
- Zalta, Edward N. (ed.). "Consequences of the Semantic Paradoxes". Stanford Encyclopedia of Philosophy.
| General | |||||||||
|---|---|---|---|---|---|---|---|---|---|
| Theorems (list) and paradoxes | |||||||||
| Logics |
| ||||||||
| Set theory |
| ||||||||
| Formal systems (list), language and syntax |
| ||||||||
| Proof theory | |||||||||
| Model theory | |||||||||
| Computability theory | |||||||||
| Related | |||||||||
 | This philosophy-related article is a stub. You can help Wikipedia by expanding it. |
 | This logic-related article is a stub. You can help Wikipedia by expanding it. |