Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'On Assertion and Indicative Conditionals' and 'The Metaontology of Abstraction'

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


23 ideas

2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
2. Reason / F. Fallacies / 1. Fallacy
It is a fallacy to explain the obscure with the even more obscure [Hale/Wright]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
'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
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 / 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 / d. Singular terms
Singular terms refer if they make certain atomic statements true [Hale/Wright]
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]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / c. Neo-logicism
Neo-Fregeanism might be better with truth-makers, rather than quantifier commitment [Hale/Wright]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / d. Logicism critique
Are neo-Fregeans 'maximalists' - that everything which can exist does exist? [Hale/Wright]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / a. Ontological commitment
The identity of Pegasus with Pegasus may be true, despite the non-existence [Hale/Wright]
8. Modes of Existence / B. Properties / 3. Types of Properties
Maybe we have abundant properties for semantics, and sparse properties for ontology [Hale/Wright]
8. Modes of Existence / B. Properties / 10. Properties as Predicates
A successful predicate guarantees the existence of a property - the way of being it expresses [Hale/Wright]
10. Modality / B. Possibility / 8. Conditionals / c. Truth-function conditionals
'If A,B' affirms that A⊃B, and also that this wouldn't change if A were certain [Jackson, by Edgington]
Conditionals are truth-functional, but should only be asserted when they are confident [Jackson, by Edgington]
18. Thought / E. Abstraction / 7. Abstracta by Equivalence
Abstractionism needs existential commitment and uniform truth-conditions [Hale/Wright]
Equivalence abstraction refers to objects otherwise beyond our grasp [Hale/Wright]
19. Language / B. Reference / 4. Descriptive Reference / a. Sense and reference
Reference needs truth as well as sense [Hale/Wright]