display all the ideas for this combination of texts
2 ideas
| 14965 | Truth rests on Elimination ('A' is true → A) and Introduction (A → 'A' is true) [Gupta] |
| 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. | |
| From: Anil Gupta (Truth [2001], 5.1) | |
| 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. |
| 14968 | A weakened classical language can contain its own truth predicate [Gupta] |
| Full Idea: If a classical language is expressively weakened - for example, by dispensing with negation - then it can contain its own truth predicate. | |
| From: Anil Gupta (Truth [2001], 5.2) | |
| A reaction: Thus the Tarskian requirement to move to a metalanguage for truth is only a requirement of a reasonably strong language. Gupta uses this to criticise theories that dispense with the metalanguage. |