18 ideas
| 15527 | Defining terms either enables elimination, or shows that they don't require elimination [Lewis] |
| Full Idea: To define theoretical terms might be to show how to do without them, but it is better to say that it shows there is no good reason to want to do without them. | |
| From: David Lewis (How to Define Theoretical Terms [1970], Intro) |
| 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. |
| 13768 | Validity can preserve certainty in mathematics, but conditionals about contingents are another matter [Edgington] |
| Full Idea: If your interest in logic is confined to applications to mathematics or other a priori matters, it is fine for validity to preserve certainty, ..but if you use conditionals when arguing about contingent matters, then great caution will be required. | |
| From: Dorothy Edgington (Conditionals [2001], 17.2.1) |
| 13770 | There are many different conditional mental states, and different conditional speech acts [Edgington] |
| Full Idea: As well as conditional beliefs, there are conditional desires, hopes, fears etc. As well as conditional statements, there are conditional commands, questions, offers, promises, bets etc. | |
| From: Dorothy Edgington (Conditionals [2001], 17.3.4) |
| 13764 | Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? [Edgington] |
| Full Idea: Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? Are they non-truth-functional, like 'because' or 'before'? Do the values of A and B, in some cases, leave open the value of 'If A,B'? | |
| From: Dorothy Edgington (Conditionals [2001], 17.1) | |
| A reaction: I would say they are not truth-functional, because the 'if' asserts some further dependency relation that goes beyond the truth or falsity of A and B. Logical ifs, causal ifs, psychological ifs... The material conditional ⊃ is truth-functional. |
| 13765 | 'If A,B' must entail ¬(A & ¬B); otherwise we could have A true, B false, and If A,B true, invalidating modus ponens [Edgington] |
| Full Idea: If it were possible to have A true, B false, and If A,B true, it would be unsafe to infer B from A and If A,B: modus ponens would thus be invalid. Hence 'If A,B' must entail ¬(A & ¬B). | |
| From: Dorothy Edgington (Conditionals [2001], 17.1) | |
| A reaction: This is a firm defence of part of the truth-functional view of conditionals, and seems unassailable. The other parts of the truth table are open to question, though, if A is false, or they are both true. |
| 15530 | A logically determinate name names the same thing in every possible world [Lewis] |
| Full Idea: A logically determinate name is one which names the same thing in every possible world. | |
| From: David Lewis (How to Define Theoretical Terms [1970], III) | |
| A reaction: This appears to be rigid designation, before Kripke introduced the new word. |
| 15528 | A Ramsey sentence just asserts that a theory can be realised, without saying by what [Lewis] |
| Full Idea: If we specify a theory with all of its terms, and then replace all of those terms with variables, we can then say that some n-tuples of entities can satisfy this formula. This Ramsey sentence then says the theory is realised, without specifying by what. | |
| From: David Lewis (How to Define Theoretical Terms [1970], II) | |
| A reaction: [I have compressed Lewis, and cut out the symbolism] |
| 15526 | There is a method for defining new scientific terms just using the terms we already understand [Lewis] |
| Full Idea: I contend that there is a general method for defining newly introduced terms in a scientific theory, one which uses only the old terms we understood beforehand. | |
| From: David Lewis (How to Define Theoretical Terms [1970], Intro) | |
| A reaction: Lewis is game is to provide bridge laws for a reductive account of nature, without having to introduce something entirely new to achieve it. The idea of bridge laws in scientific theory is less in favour these days. |
| 15529 | It is better to have one realisation of a theory than many - but it may not always be possible [Lewis] |
| Full Idea: A uniquely realised theory is, other things being equal, certainly more satisfactory than a multiply realised theory. We should insist on unique realisation as a standard of correctness unless it is a standard too high to be met. | |
| From: David Lewis (How to Define Theoretical Terms [1970], III) | |
| A reaction: The point is that rewriting a theory as Ramsey sentences just says there is at least one realisation, and so it doesn't meet the highest standards for scientific theories. The influence of set-theoretic model theory is obvious in this approach. |
| 15531 | The Ramsey sentence of a theory says that it has at least one realisation [Lewis] |
| Full Idea: The Ramsey sentence of a theory says that it has at least one realisation. | |
| From: David Lewis (How to Define Theoretical Terms [1970], V) |