10 ideas
| 18073 | Dummett says classical logic rests on meaning as truth, while intuitionist logic rests on assertability [Dummett, by Kitcher] |
| Full Idea: Dummett argues that classical logic depends on the choice of the concept of truth as central to the theory of meaning, while for the intuitionist the concept of assertability occupies this position. | |
| From: report of Michael Dummett (The philosophical basis of intuitionist logic [1973]) by Philip Kitcher - The Nature of Mathematical Knowledge 06.5 | |
| A reaction: Since I can assert any nonsense I choose, this presumably means 'warranted' assertability, which is tied to the concept of proof in mathematics. You can reason about falsehoods, or about uninterpreted variables. Can you 'assert' 'Fx'? |
| 17879 | Axiomatising set theory makes it all relative [Skolem] |
| Full Idea: Axiomatising set theory leads to a relativity of set-theoretic notions, and this relativity is inseparably bound up with every thoroughgoing axiomatisation. | |
| From: Thoralf Skolem (Remarks on axiomatised set theory [1922], p.296) |
| 19057 | Classical quantification is an infinite conjunction or disjunction - but you may not know all the instances [Dummett] |
| Full Idea: Classical quantification represents an infinite conjunction or disjunction, and the truth-value is determined by the infinite sum or product of the instances ....but this presupposes that all the instances already possess determinate truth-values. | |
| From: Michael Dummett (The philosophical basis of intuitionist logic [1973], p.246) | |
| A reaction: In the case of the universal quantifier, Dummett is doing no more than citing the classic empiricism objection to induction - that you can't make the universal claim if you don't know all the instances. The claim is still meaningful, though. |
| 17878 | If a 1st-order proposition is satisfied, it is satisfied in a denumerably infinite domain [Skolem] |
| Full Idea: Löwenheim's theorem reads as follows: If a first-order proposition is satisfied in any domain at all, it is already satisfied in a denumerably infinite domain. | |
| From: Thoralf Skolem (Remarks on axiomatised set theory [1922], p.293) |
| 17880 | Integers and induction are clear as foundations, but set-theory axioms certainly aren't [Skolem] |
| Full Idea: The initial foundations should be immediately clear, natural and not open to question. This is satisfied by the notion of integer and by inductive inference, by it is not satisfied by the axioms of Zermelo, or anything else of that kind. | |
| From: Thoralf Skolem (Remarks on axiomatised set theory [1922], p.299) | |
| A reaction: This is a plea (endorsed by Almog) that the integers themselves should be taken as primitive and foundational. I would say that the idea of successor is more primitive than the integers. |
| 17881 | Mathematician want performable operations, not propositions about objects [Skolem] |
| Full Idea: Most mathematicians want mathematics to deal, ultimately, with performable computing operations, and not to consist of formal propositions about objects called this or that. | |
| From: Thoralf Skolem (Remarks on axiomatised set theory [1922], p.300) |
| 19055 | Stating a sentence's truth-conditions is just paraphrasing the sentence [Dummett] |
| Full Idea: An ability to state the condition for the truth of a sentence is, in effect, no more than an ability to express the content of the sentence in other words. | |
| From: Michael Dummett (The philosophical basis of intuitionist logic [1973], p.224) | |
| A reaction: Alternatively, if you give something other than a paraphrase of the sentence as its meaning (such as a proof of its truth), then you seem to have departed from your target sentence. Can we reduce and eliminate our sentences in this way? |
| 19056 | If a sentence is effectively undecidable, we can never know its truth conditions [Dummett] |
| Full Idea: If a sentence is effectively undecidable, the condition which must obtain for it to be true is not one which we are capable of recognising whenever it obtains, or of getting ourselves in a position to do so. | |
| From: Michael Dummett (The philosophical basis of intuitionist logic [1973], p.225) | |
| A reaction: The instances of 'undecidable' sentences are most clearly seen in mathematics, such as the Continuum Hypothesis or Goldbach's Conjecture, or anything involving vast infinite cardinals. But do you need precise truth-conditions for meaning? |
| 19054 | Meaning as use puts use beyond criticism, and needs a holistic view of language [Dummett] |
| Full Idea: If use constitutes meaning, it might seem that use is beyond criticism. ....But such an attitude can, ultimately, be supported onlly by the adoption of a holistic view of language. | |
| From: Michael Dummett (The philosophical basis of intuitionist logic [1973], p.218) | |
| A reaction: Dummett goes on to say that the rejection of the holistic view of mathematical meaning leads to his preference for intuitionistic logic. |
| 14080 | Are causal descriptions part of the causal theory of reference, or are they just metasemantic? [Kaplan, by Schaffer,J] |
| Full Idea: Kaplan notes that the causal theory of reference can be understood in two quite different ways, as part of the semantics (involving descriptions of causal processes), or as metasemantics, explaining why a term has the referent it does. | |
| From: report of David Kaplan (Dthat [1970]) by Jonathan Schaffer - Deflationary Metaontology of Thomasson 1 | |
| A reaction: [Kaplan 'Afterthought' 1989] The theory tends to be labelled as 'direct' rather than as 'causal' these days, but causal chains are still at the heart of the story (even if more diffused socially). Nice question. Kaplan takes the meta- version as orthodox. |