Combining Texts

All the ideas for 'Against Coherence', 'Introduction to Zermelo's 1930 paper' and 'What is Logic?'

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

21 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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
17833 The first-order ZF axiomatisation is highly non-categorical [Hallett,M]
17834 Non-categoricity reveals a sort of incompleteness, with sets existing that the axioms don't reveal [Hallett,M]
4. Formal Logic / F. Set Theory ST / 7. Natural Sets
17837 Zermelo allows ur-elements, to enable the widespread application of set-theory [Hallett,M]
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 / 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]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / g. Continuum Hypothesis
17836 The General Continuum Hypothesis and its negation are both consistent with ZF [Hallett,M]
13. Knowledge Criteria / B. Internal Justification / 5. Coherentism / a. Coherence as justification
21515 Incoherence may be more important for enquiry than coherence [Olsson]
21514 Coherence is the capacity to answer objections [Olsson]
13. Knowledge Criteria / B. Internal Justification / 5. Coherentism / c. Coherentism critique
21496 Mere agreement of testimonies is not enough to make truth very likely [Olsson]
21499 Coherence is only needed if the information sources are not fully reliable [Olsson]
21502 A purely coherent theory cannot be true of the world without some contact with the world [Olsson]
21512 Extending a system makes it less probable, so extending coherence can't make it more probable [Olsson]