Combining Texts

Ideas for 'What is Logic?st1=Ian Hacking', 'The Philosophy of Logical Atomism' and 'Russell's Ontological Development'

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

display all the ideas for this combination of texts


13 ideas

5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
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
First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking]
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
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
In a logically perfect language, there will be just one word for every simple object [Russell]
Romulus does not occur in the proposition 'Romulus did not exist' [Russell]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
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
Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking]
5. Theory of Logic / F. Referring in Logic / 1. Naming / a. Names
You can understand 'author of Waverley', but to understand 'Scott' you must know who it applies to [Russell]
There are a set of criteria for pinning down a logically proper name [Russell, by Sainsbury]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
Treat description using quantifiers, and treat proper names as descriptions [Russell, by McCullogh]
5. Theory of Logic / F. Referring in Logic / 1. Naming / e. Empty names
A name has got to name something or it is not a name [Russell]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]