Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'Introduction to the Theory of Logic' and 'Later Letters to Dedekind'

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

30 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 / 1. Set Theory
10888 Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
10889 The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo]
10890 A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
17831 Cantor gives informal versions of ZF axioms as ways of getting from one set to another [Cantor, by Lake]
10886 Determinacy: an object is either in a set, or it isn't [Zalabardo]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / l. Axiom of Specification
10887 Specification: Determinate totals of objects always make a set [Zalabardo]
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]
10897 A first-order 'sentence' is a formula with no free variables [Zalabardo]
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 / 4. Semantic Consequence |=
10893 Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
10899 Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
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 / 2. Logical Connectives / b. Basic connectives
10896 Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
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 / I. Semantics of Logic / 1. Semantics of Logic
10898 The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
10902 We can do semantics by looking at given propositions, or by building new ones [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
10892 We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
10895 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
10900 Logically true sentences are true in all structures [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
10901 Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
10894 A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
10903 A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo]
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 / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
10891 If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]