Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'talk' and 'On Second-Order Logic'

expand these ideas     |    start again     |     specify just one area for these texts

19 ideas

2. Reason / D. Definition / 3. Types of Definition
13838 A decent modern definition should always imply a semantics [Hacking]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
13834 Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
13835 Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
13833 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
13845 The various logics are abstractions made from terms like 'if...then' in English [Hacking]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
13840 First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking]
13844 A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
13842 Second-order completeness seems to need intensional entities and possible worlds [Hacking]
14249 Boolos reinterprets second-order logic as plural logic [Boolos, by Oliver/Smiley]
10830 Second-order logic metatheory is set-theoretic, and second-order validity has set-theoretic problems [Boolos]
5. Theory of Logic / C. Ontology of Logic / 1. Ontology of Logic
10829 A sentence can't be a truth of logic if it asserts the existence of certain sets [Boolos]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
13837 With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking]
5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic
13839 Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking]
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
10832 '∀x x=x' only means 'everything is identical to itself' if the range of 'everything' is fixed [Boolos]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
13843 If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]
5. Theory of Logic / K. Features of Logics / 4. Completeness
10834 Weak completeness: if it is valid, it is provable. Strong: it is provable from a set of sentences [Boolos]
5. Theory of Logic / K. Features of Logics / 6. Compactness
13841 Why should compactness be definitive of logic? [Boolos, by Hacking]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / e. Peano arithmetic 2nd-order
10833 Many concepts can only be expressed by second-order logic [Boolos]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / a. Constructivism
9916 Convention, yes! Arbitrary, no! [Poincaré, by Putnam]