Combining Philosophers

Ideas for Tim Button, Ian Hacking and Robert Hanna

expand these ideas     |    start again     |     choose another area for these philosophers

display all the ideas for this combination of philosophers

11 ideas

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]
11058 Logic is explanatorily and ontologically dependent on rational animals [Hanna]
11072 Logic is personal and variable, but it has a universal core [Hanna]
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]
5. Theory of Logic / B. Logical Consequence / 1. Logical Consequence
11061 Intensional consequence is based on the content of the concepts [Hanna]
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 / J. Model Theory in Logic / 1. Logical Models
18694 Permutation Theorem: any theory with a decent model has lots of models [Button]
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]