more on this theme | more from this thinker
Full Idea
The basic principles governing truth are Truth Elimination (sentence A follows from ''A' is true') and the converse Truth Introduction (''A' is true' follows from A), which combine into Tarski's T-schema - 'A' is true if and only if A.
Gist of Idea
Truth rests on Elimination ('A' is true → A) and Introduction (A → 'A' is true)
Source
Anil Gupta (Truth [2001], 5.1)
Book Ref
'Blackwell Guide to Philosophical Logic', ed/tr. Goble,Lou [Blackwell 2001], p.91
A Reaction
Introduction and Elimination rules are the basic components of natural deduction systems, so 'true' now works in the same way as 'and', 'or' etc. This is the logician's route into truth.
| 14965 | Truth rests on Elimination ('A' is true → A) and Introduction (A → 'A' is true) [Gupta] |
| 14964 | The Liar reappears, even if one insists on propositions instead of sentences [Gupta] |
| 14968 | A weakened classical language can contain its own truth predicate [Gupta] |
| 14969 | Strengthened Liar: either this sentence is neither-true-nor-false, or it is not true [Gupta] |