15 ideas
| 10282 | Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W] |
| Full Idea: A logic is a collection of closely related artificial languages, and its older meaning is the study of the rules of sound argument. The languages can be used as a framework for studying rules of argument. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.1) | |
| A reaction: [Hodges then says he will stick to the languages] The suspicion is that one might confine the subject to the artificial languages simply because it is easier, and avoids the tricky philosophical questions. That approximates to computer programming. |
| 10283 | A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W] |
| Full Idea: To have a truth-value, a first-order formula needs an 'interpretation' (I) of its constants, and a 'valuation' (ν) of its variables. Something in the world is attached to the constants; objects are attached to variables. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.3) |
| 10284 | There are three different standard presentations of semantics [Hodges,W] |
| Full Idea: Semantic rules can be presented in 'Tarski style', where the interpretation-plus-valuation is reduced to the same question for simpler formulas, or the 'Henkin-Hintikka style' in terms of games, or the 'Barwise-Etchemendy style' for computers. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.3) | |
| A reaction: I haven't yet got the hang of the latter two, but I note them to map the territory. |
| 10285 | I |= φ means that the formula φ is true in the interpretation I [Hodges,W] |
| Full Idea: I |= φ means that the formula φ is true in the interpretation I. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.5) | |
| A reaction: [There should be no space between the vertical and the two horizontals!] This contrasts with |-, which means 'is proved in'. That is a syntactic or proof-theoretic symbol, whereas |= is a semantic symbol (involving truth). |
| 10288 | Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W] |
| Full Idea: Downward Löwenheim-Skolem (the weakest form): If L is a first-order language with at most countably many formulas, and T is a consistent theory in L. Then T has a model with at most countably many elements. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.10) |
| 10289 | Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W] |
| Full Idea: Upward Löwenheim-Skolem: every first-order theory with infinite models has arbitrarily large models. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.10) |
| 10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
| Full Idea: Compactness Theorem: suppose T is a first-order theory, ψ is a first-order sentence, and T entails ψ. Then there is a finite subset U of T such that U entails ψ. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.10) | |
| A reaction: If entailment is possible, it can be done finitely. |
| 10286 | A 'set' is a mathematically well-behaved class [Hodges,W] |
| Full Idea: A 'set' is a mathematically well-behaved class. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.6) |
| 12899 | The timid student has knowledge without belief, lacking confidence in their correct answer [Lewis] |
| Full Idea: I allow knowledge without belief, as in the case of the timid student who knows the answer but has no confidence that he has it right, and so does not believe what he knows. | |
| From: David Lewis (Elusive Knowledge [1996], p.429) | |
| A reaction: [He cites Woozley 1953 for the timid student] I don't accept this example (since my views on knowledge are rather traditional, I find). Why would the student give that answer if they didn't believe it? Sustained timid correctness never happens. |
| 12897 | To say S knows P, but cannot eliminate not-P, sounds like a contradiction [Lewis] |
| Full Idea: If you claim that S knows that P, and yet grant that S cannot eliminate a certain possibility of not-P, it certainly seems as if you have granted that S does not after all know that P. To speak of fallible knowledge just sounds contradictory. | |
| From: David Lewis (Elusive Knowledge [1996], p.419) | |
| A reaction: Starting from this point, fallibilism seems to be a rather bold move. The only sensible response seems to be to relax the requirement that not-P must be eliminable. Best: in one epistemic context P, in another not-P. |
| 12898 | Justification is neither sufficient nor necessary for knowledge [Lewis] |
| Full Idea: I don't agree that the mark of knowledge is justification, first because justification isn't sufficient - your true opinion that you will lose the lottery isn't knowledge, whatever the odds; and also not necessary - for what supports perception or memory? | |
| From: David Lewis (Elusive Knowledge [1996]) | |
| A reaction: I don't think I agree. The point about the lottery is that an overwhelming reason will never get you to knowing that you won't win. But good reasons are coherent, not statistical. If perceptions are dubious, justification must be available. |
| 12895 | Knowing is context-sensitive because the domain of quantification varies [Lewis, by Cohen,S] |
| Full Idea: The context-sensitivity of 'knows' is a function of contextual restrictions on the domain of quantification. | |
| From: report of David Lewis (Elusive Knowledge [1996]) by Stewart Cohen - Contextualism Defended p.68 | |
| A reaction: I think the shifting 'domain of quantification' is one of the most interesting features of ordinary talk. Or, more plainly. 'what are you actually talking about?' is the key question in any fruitful dialogue. Sophisticated speakers tacitly shift domain. |
| 19562 | We have knowledge if alternatives are eliminated, but appropriate alternatives depend on context [Lewis, by Cohen,S] |
| Full Idea: S knows P if S's evidence eliminates every alternative. But the nature of the alternatives depends on context. So for Lewis, the context sensitivity of 'knows' is a function of contextual restrictions ln the domain of quantification. | |
| From: report of David Lewis (Elusive Knowledge [1996]) by Stewart Cohen - Contextualism Defended (and reply) 1 | |
| A reaction: A typical modern attempt to 'regiment' a loose term like 'context'. That said, I like the idea. I'm struck by how the domain varies during a conversation (as in 'what we are talking about'). Domains standardly contain 'objects', though. |
| 1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
| Full Idea: Archelaus was the first person to say that the universe is boundless. | |
| From: report of Archelaus (fragments/reports [c.450 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 02.Ar.3 |
| 5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |
| Full Idea: Archelaus wrote that life on Earth began in a primeval slime. | |
| From: report of Archelaus (fragments/reports [c.450 BCE]) by Malcolm Schofield - Archelaus | |
| A reaction: This sounds like a fairly clearcut assertion of the production of life by evolution. Darwin's contribution was to propose the mechanism for achieving it. We should honour the name of Archelaus for this idea. |