Combining Texts
Ideas for
'fragments/reports', 'works' and 'What is Logic?'
expand these ideas
|
start again
|
choose
another area for these texts
display all the ideas for this combination of texts
10 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]
|
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 / 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 / F. Referring in Logic / 1. Naming / b. Names as descriptive
21878
|
Names have a subjective aspect, especially the role of our own name [Derrida]
|
21889
|
'I' is the perfect name, because it denotes without description [Derrida]
|
5. Theory of Logic / F. Referring in Logic / 1. Naming / c. Names as referential
21879
|
Even Kripke can't explain names; the word is the thing, and the thing is the word [Derrida]
|
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]
|