21 ideas
| 13838 | A decent modern definition should always imply a semantics [Hacking] |
| Full Idea: Today we expect that anything worth calling a definition should imply a semantics. | |
| From: Ian Hacking (What is Logic? [1979], §10) | |
| A reaction: He compares this with Gentzen 1935, who was attempting purely syntactic definitions of the logical connectives. |
| 13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
| Full Idea: 'Dilution' (or 'Thinning') provides an essential contrast between deductive and inductive reasoning; for the introduction of new premises may spoil an inductive inference. | |
| From: Ian Hacking (What is Logic? [1979], §06.2) | |
| A reaction: That is, inductive logic (if there is such a thing) is clearly non-monotonic, whereas classical inductive logic is monotonic. |
| 13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
| Full Idea: If A |- B and B |- C, then A |- C. This generalises to: If Γ|-A,Θ and Γ,A |- Θ, then Γ |- Θ. Gentzen called this 'cut'. It is the transitivity of a deduction. | |
| From: Ian Hacking (What is Logic? [1979], §06.3) | |
| A reaction: I read the generalisation as 'If A can be either a premise or a conclusion, you can bypass it'. The first version is just transitivity (which by-passes the middle step). |
| 13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
| Full Idea: Only the cut rule can have a conclusion that is less complex than its premises. Hence when cut is not used, a derivation is quite literally constructive, building up from components. Any theorem obtained by cut can be obtained without it. | |
| From: Ian Hacking (What is Logic? [1979], §08) |
| 12452 | Our dislike of contradiction in logic is a matter of psychology, not mathematics [Brouwer] |
| Full Idea: Not to the mathematician, but to the psychologist, belongs the task of explaining why ...we are averse to so-called contradictory systems in which the negative as well as the positive of certain propositions are valid. | |
| From: Luitzen E.J. Brouwer (Intuitionism and Formalism [1912], p.79) | |
| A reaction: Was the turning point of Graham Priest's life the day he read this sentence? I don't agree. I take the principle of non-contradiction to be a highly generalised observation of how the world works (and Russell agrees with me). |
| 13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
| Full Idea: I don't believe English is by nature classical or intuitionistic etc. These are abstractions made by logicians. Logicians attend to numerous different objects that might be served by 'If...then', like material conditional, strict or relevant implication. | |
| From: Ian Hacking (What is Logic? [1979], §15) | |
| A reaction: The idea that they are 'abstractions' is close to my heart. Abstractions from what? Surely 'if...then' has a standard character when employed in normal conversation? |
| 13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
| Full Idea: Henkin proved that there is no first-order treatment of branching quantifiers, which do not seem to involve any idea that is fundamentally different from ordinary quantification. | |
| From: Ian Hacking (What is Logic? [1979], §13) | |
| A reaction: See Hacking for an example of branching quantifiers. Hacking is impressed by this as a real limitation of the first-order logic which he generally favours. |
| 13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
| Full Idea: First-order logic is the strongest complete compact theory with a Löwenheim-Skolem theorem. | |
| From: Ian Hacking (What is Logic? [1979], §13) |
| 13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
| Full Idea: Second-order logic has no chance of a completeness theorem unless one ventures into intensional entities and possible worlds. | |
| From: Ian Hacking (What is Logic? [1979], §13) |
| 13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
| Full Idea: My doctrine is that the peculiarity of the logical constants resides precisely in that given a certain pure notion of truth and consequence, all the desirable semantic properties of the constants are determined by their syntactic properties. | |
| From: Ian Hacking (What is Logic? [1979], §09) | |
| A reaction: He opposes this to Peacocke 1976, who claims that the logical connectives are essentially semantic in character, concerned with the preservation of truth. |
| 13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
| Full Idea: For some purposes the variables of first-order logic can be regarded as prepositions and place-holders that could in principle be dispensed with, say by a system of arrows indicating what places fall in the scope of which quantifier. | |
| From: Ian Hacking (What is Logic? [1979], §11) | |
| A reaction: I tend to think of variables as either pronouns, or as definite descriptions, or as temporary names, but not as prepositions. Must address this new idea... |
| 13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
| Full Idea: A Löwenheim-Skolem theorem holds for anything which, on my delineation, is a logic. | |
| From: Ian Hacking (What is Logic? [1979], §13) | |
| A reaction: I take this to be an unusually conservative view. Shapiro is the chap who can give you an alternative view of these things, or Boolos. |
| 12451 | Scientific laws largely rest on the results of counting and measuring [Brouwer] |
| Full Idea: A large part of the natural laws introduced by science treat only of the mutual relations between the results of counting and measuring. | |
| From: Luitzen E.J. Brouwer (Intuitionism and Formalism [1912], p.77) | |
| A reaction: His point, I take it, is that the higher reaches of numbers have lost touch with the original point of the system. I now see the whole issue as just depending on conventions about the agreed extension of the word 'number'. |
| 12454 | Intuitionists only accept denumerable sets [Brouwer] |
| Full Idea: The intuitionist recognises only the existence of denumerable sets. | |
| From: Luitzen E.J. Brouwer (Intuitionism and Formalism [1912], p.80) | |
| A reaction: That takes you up to omega, but not beyond, presumably because it then loses sight of the original intuition of 'bare two-oneness' (Idea 12453). I sympathise, but the word 'number' has shifted its meaning a lot these days. |
| 12453 | Neo-intuitionism abstracts from the reuniting of moments, to intuit bare two-oneness [Brouwer] |
| Full Idea: Neo-intuitionism sees the falling apart of moments, reunited while remaining separated in time, as the fundamental phenomenon of human intellect, passing by abstracting to mathematical thinking, the intuition of bare two-oneness. | |
| From: Luitzen E.J. Brouwer (Intuitionism and Formalism [1912], p.80) | |
| A reaction: [compressed] A famous and somewhat obscure idea. He goes on to say that this creates one and two, and all the finite ordinals. |
| 13857 | Truth-functional possibilities include the irrelevant, which is a mistake [Edgington] |
| Full Idea: How likely is a fair die landing on an even number to land six? My approach is, assume an even number, so three possibilities, one a six, so 'one third'; the truth-functional approach is it's true if it is not-even or six, so 'two-thirds'. | |
| From: Dorothy Edgington (Do Conditionals Have Truth Conditions? [1986], 3) | |
| A reaction: The point is that in the truth-functional approach, if the die lands not-even, then the conditional comes out as true, when she says it should be irrelevant. She seems to be right about this. |
| 13853 | It is a mistake to think that conditionals are statements about how the world is [Edgington] |
| Full Idea: The mistake philosophers have made, in trying to understand the conditional, is to assume that its function is to make a statement about how the world is (or how other possible worlds are related to it), true or false, as the case may be. | |
| From: Dorothy Edgington (Do Conditionals Have Truth Conditions? [1986], 1) | |
| A reaction: 'If pigs could fly we would never catch them' may not be about the world, but 'if you press this switch the light comes on' seems to be. Actually even the first one is about the world. I've an inkling that Edgington is wrong about this. Powers! |
| 13855 | A conditional does not have truth conditions [Edgington] |
| Full Idea: A conditional does not have truth conditions. | |
| From: Dorothy Edgington (Do Conditionals Have Truth Conditions? [1986], 1) |
| 13859 | X believes 'if A, B' to the extent that A & B is more likely than A & ¬B [Edgington] |
| Full Idea: X believes that if A, B, to the extent that he judges that A & B is nearly as likely as A, or (roughly equivalently) to the extent that he judges A & B to be more likely than A & ¬B. | |
| From: Dorothy Edgington (Do Conditionals Have Truth Conditions? [1986], 5) | |
| A reaction: This is a formal statement of her theory of conditionals. |
| 13854 | Conditionals express what would be the outcome, given some supposition [Edgington] |
| Full Idea: It is often necessary to suppose (or assume) that some epistemic possibility is true, and to consider what else would be the case, or would be likely to be the case, given this supposition. The conditional expresses the outcome of such thought processes. | |
| From: Dorothy Edgington (Do Conditionals Have Truth Conditions? [1986], 1) | |
| A reaction: This is the basic Edgington view. It seems to involve an active thought process, and imagination, rather than being the static semantic relations offered by possible worlds analyses. True conditionals state relationships in the world. |
| 10117 | Intuitonists in mathematics worried about unjustified assertion, as well as contradiction [Brouwer, by George/Velleman] |
| Full Idea: The concern of mathematical intuitionists was that the use of certain forms of inference generates, not contradiction, but unjustified assertions. | |
| From: report of Luitzen E.J. Brouwer (Intuitionism and Formalism [1912]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6 | |
| A reaction: This seems to be the real origin of the verificationist idea in the theory of meaning. It is a hugely revolutionary idea - that ideas are not only ruled out of court by contradiction, but that there are other criteria which should also be met. |