21 ideas
| 6806 | Do not multiply entities beyond necessity [William of Ockham] |
| Full Idea: Do not multiply entities beyond necessity. | |
| From: William of Ockham (works [1335]) | |
| A reaction: This is the classic statement of Ockham's Razor, though it is not found in his printed works. It appears to be mainly aimed at Plato's Theory of Forms. It is taken to refer to types of entities, not numbers. One seraph is as bad as a hundred. |
| 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. |
| 13373 | Typically, paradoxes are dealt with by dividing them into two groups, but the division is wrong [Priest,G] |
| Full Idea: A natural principle is the same kind of paradox will have the same kind of solution. Standardly Ramsey's first group are solved by denying the existence of some totality, and the second group are less clear. But denial of the groups sink both. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §5) | |
| A reaction: [compressed] This sums up the argument of Priest's paper, which is that it is Ramsey's division into two kinds (see Idea 13334) which is preventing us from getting to grips with the paradoxes. Priest, notoriously, just lives with them. |
| 13368 | The 'least indefinable ordinal' is defined by that very phrase [Priest,G] |
| Full Idea: König: there are indefinable ordinals, and the least indefinable ordinal has just been defined in that very phrase. (Recall that something is definable iff there is a (non-indexical) noun-phrase that refers to it). | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §3) | |
| A reaction: Priest makes great subsequent use of this one, but it feels like a card trick. 'Everything indefinable has now been defined' (by the subject of this sentence)? König, of course, does manage to pick out one particular object. |
| 13370 | 'x is a natural number definable in less than 19 words' leads to contradiction [Priest,G] |
| Full Idea: Berry: if we take 'x is a natural number definable in less than 19 words', we can generate a number which is and is not one of these numbers. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §3) | |
| A reaction: [not enough space to spell this one out in full] |
| 13369 | By diagonalization we can define a real number that isn't in the definable set of reals [Priest,G] |
| Full Idea: Richard: φ(x) is 'x is a definable real number between 0 and 1' and ψ(x) is 'x is definable'. We can define a real by diagonalization so that it is not in x. It is and isn't in the set of reals. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §3) | |
| A reaction: [this isn't fully clear here because it is compressed] |
| 13366 | The least ordinal greater than the set of all ordinals is both one of them and not one of them [Priest,G] |
| Full Idea: Burali-Forti: φ(x) is 'x is an ordinal', and so w is the set of all ordinals, On; δ(x) is the least ordinal greater than every member of x (abbreviation: log(x)). The contradiction is that log(On)∈On and log(On)∉On. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §2) |
| 13367 | The next set up in the hierarchy of sets seems to be both a member and not a member of it [Priest,G] |
| Full Idea: Mirimanoff: φ(x) is 'x is well founded', so that w is the cumulative hierarchy of sets, V; &delta(x) is just the power set of x, P(x). If x⊆V, then V∈V and V∉V, since δ(V) is just V itself. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §2) |
| 13371 | If you know that a sentence is not one of the known sentences, you know its truth [Priest,G] |
| Full Idea: In the family of the Liar is the Knower Paradox, where φ(x) is 'x is known to be true', and there is a set of known things, Kn. By knowing a sentence is not in the known sentences, you know its truth. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §4) | |
| A reaction: [mostly my wording] |
| 13372 | There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G] |
| Full Idea: There are liar chains which fit the pattern of Transcendence and Closure, as can be seen with the simplest case of the Liar Pair. | |
| From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §4) | |
| A reaction: [Priest gives full details] Priest's idea is that Closure is when a set is announced as complete, and Transcendence is when the set is forced to expand. He claims that the two keep coming into conflict. |
| 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) |
| 22132 | Species and genera are individual concepts which naturally signify many individuals [William of Ockham] |
| Full Idea: In his mature nominalism, species and genera are identified with certain mental qualities called concepts or intentions of the mind. Ontologically they are individuals too, like everthing else, ...but they naturally signify many different individuals. | |
| From: William of Ockham (works [1335]), quoted by Claude Panaccio - William of Ockham p.1056 | |
| A reaction: 'Naturally' is the key word, because the concepts are not fictions, but natural responses to encountering individuals in the world. I am an Ockhamist. |
| 19381 | The past has ceased to exist, and the future does not yet exist, so time does not exist [William of Ockham] |
| Full Idea: Time is composed of non-entities, because it is composed of the past which does not exist now, although it did exist, and of the future, which does not yet exist; therefore time does not exist. | |
| From: William of Ockham (works [1335], 6:496), quoted by Richard T.W. Arthur - Leibniz 7 'Nominalist' | |
| A reaction: I've a lot of sympathy with this! I favour Presentism, so the past is gone and the future is yet to arrive. But we have no coherent concept of a present moment of any duration to contain reality. We are just completely bogglificated by it all. |
| 8010 | William of Ockham is the main spokesman for God's commands being the source of morality [William of Ockham] |
| Full Idea: The most notable philosopher who makes God's commandment the basis of goodness, rather than God's goodness a reason for obeying him, is William of Occam. | |
| From: William of Ockham (works [1335]), quoted by Alasdair MacIntyre - A Short History of Ethics Ch.9 | |
| A reaction: Either view has problems. Why choose God to obey? Obey anyone who is powerful? But how do you decide that God is good? How do we know the nature of God's commands, or the nature of God's goodness? Etc. |
| 16679 | Even an angel must have some location [William of Ockham, by Pasnau] |
| Full Idea: Ockham dismisses the possibility of non-location out of hand, remarking that even an angel has some location. | |
| From: report of William of Ockham (works [1335]) by Robert Pasnau - Metaphysical Themes 1274-1671 14.4 |