display all the ideas for this combination of texts
5 ideas
| 8083 | Boole applied normal algebra to logic, aiming at an algebra of thought [Boole, by Devlin] |
| Full Idea: Boole proposed to use the entire apparatus of a school algebra class, with operations such as addition and multiplication, methods to solve equations, and the like, to produce an algebra of thought. | |
| From: report of George Boole (The Laws of Thought [1854]) by Keith Devlin - Goodbye Descartes Ch.3 | |
| A reaction: The Stoics didn’t use any algebraic notation for their study of propositions, so Boole's idea launched full blown propositional logic, and the rest of modern logic followed. Nice one. |
| 7727 | Boole's notation can represent syllogisms and propositional arguments, but not both at once [Boole, by Weiner] |
| Full Idea: Boole introduced a new symbolic notation in which it was possible to represent both syllogisms and propositional arguments, ...but not both at once. | |
| From: report of George Boole (The Laws of Thought [1854], Ch.3) by Joan Weiner - Frege | |
| A reaction: How important is the development of symbolic notations for the advancement of civilisations? Is there a perfect notation, as used in logical heaven? |
| 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) |