Combining Texts

All the ideas for 'A Puzzle about Belief', 'Presidential Address of Am. Math. Soc' and 'Truth'

unexpand these ideas     |    start again     |     specify just one area for these texts


6 ideas

3. Truth / F. Semantic Truth / 1. Tarski's Truth / a. Tarski's truth definition
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.
3. Truth / F. Semantic Truth / 2. Semantic Truth
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.
5. Theory of Logic / A. Overview of Logic / 2. History of Logic
We have no adequate logic at the moment, so mathematicians must create one [Veblen]
     Full Idea: Formal logic has to be taken over by mathematicians. The fact is that there does not exist an adequate logic at the present time, and unless the mathematicians create one, no one else is likely to do so.
     From: Oswald Veblen (Presidential Address of Am. Math. Soc [1924], 141), quoted by Stewart Shapiro - Philosophy of Mathematics
     A reaction: This remark was made well after Frege, but before the advent of Gödel and Tarski. That implies that he was really thinking of meta-logic.
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
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.
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.
18. Thought / B. Mechanics of Thought / 5. Mental Files
Puzzled Pierre has two mental files about the same object [Recanati on Kripke]
     Full Idea: In Kripke's puzzle about belief, the subject has two distinct mental files about one and the same object.
     From: comment on Saul A. Kripke (A Puzzle about Belief [1979]) by François Recanati - Mental Files 17.1
     A reaction: [Pierre distinguishes 'London' from 'Londres'] The Kripkean puzzle is presented as very deep, but I have always felt there was a simple explanation, and I suspect that this is it (though I will leave the reader to think it through, as I'm very busy…).