7 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. |
| 14964 | The Liar reappears, even if one insists on propositions instead of sentences [Gupta] |
| Full Idea: There is the idea that the Liar paradox is solved simply by noting that truth is a property of propositions (not of sentences), and the Liar sentence does not express a proposition. But we then say 'I am not now expressing a true proposition'! | |
| From: Anil Gupta (Truth [2001], 5.1) | |
| A reaction: Disappointed to learn this, since I think focusing on propositions (which are unambiguous) rather than sentences solves a huge number of philosophical problems. |
| 14969 | Strengthened Liar: either this sentence is neither-true-nor-false, or it is not true [Gupta] |
| Full Idea: An example of the Strengthened Liar is the following statement SL: 'Either SL is neither-true-nor-false or it is not true'. This raises a serious problem for any theory that assesses the paradoxes to be neither true nor false. | |
| From: Anil Gupta (Truth [2001], 5.4.2) | |
| A reaction: If the sentence is either true or false it reduces to the ordinary Liar. If it is neither true nor false, then it is true. |
| 10558 | Abstract objects are actually constituted by the properties by which we conceive them [Zalta] |
| Full Idea: Where for ordinary objects one can discover the properties they exemplify, abstract objects are actually constituted or determined by the properties by which we conceive them. I use the technical term 'x encodes F' for this idea. | |
| From: Edward N. Zalta (Deriving Kripkean Claims with Abstract Objects [2006], 2 n2) | |
| A reaction: One might say that whereas concrete objects can be dubbed (in the Kripke manner), abstract objects can only be referred to by descriptions. See 10557 for more technicalities about Zalta's idea. |
| 3102 | Why don't we experience or remember going to sleep at night? [Magee] |
| Full Idea: As a child it was incomprehensible to me that I did not experience going to sleep, and never remembered it. When my sister said 'Nobody remembers that', I just thought 'How does she know?' | |
| From: Bryan Magee (Confessions of a Philosopher [1997], Ch.I) | |
| A reaction: This is actually evidence for something - that we do not have some sort of personal identity which is separate from consciousness, so that "I am conscious" would literally mean that an item has a property, which it can lose. |
| 10557 | Abstract objects are captured by second-order modal logic, plus 'encoding' formulas [Zalta] |
| Full Idea: My object theory is formulated in a 'syntactically second-order' modal predicate calculus modified only so as to admit a second kind of atomic formula ('xF'), which asserts that object x 'encodes' property F. | |
| From: Edward N. Zalta (Deriving Kripkean Claims with Abstract Objects [2006], p.2) | |
| A reaction: This is summarising Zalta's 1983 theory of abstract objects. See Idea 10558 for Zalta's idea in plain English. |