Combining Texts

All the ideas for 'Logical Consequence', 'The Theory of Logical Types' and 'Set Theory and the Continuum Hypothesis'

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


14 ideas

4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
'Equivocation' is when terms do not mean the same thing in premises and conclusion [Beall/Restall]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
Formal logic is invariant under permutations, or devoid of content, or gives the norms for thought [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
Logical consequence needs either proofs, or absence of counterexamples [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
Logical consequence is either necessary truth preservation, or preservation based on interpretation [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 8. Material Implication
A step is a 'material consequence' if we need contents as well as form [Beall/Restall]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
'Propositional functions' are ambiguous until the variable is given a value [Russell]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
A 'logical truth' (or 'tautology', or 'theorem') follows from empty premises [Beall/Restall]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
Models are mathematical structures which interpret the non-logical primitives [Beall/Restall]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
'All judgements made by Epimenedes are true' needs the judgements to be of the same type [Russell]
6. Mathematics / B. Foundations for Mathematics / 2. Proof in Mathematics
Hilbert proofs have simple rules and complex axioms, and natural deduction is the opposite [Beall/Restall]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / b. Type theory
Type theory cannot identify features across levels (because such predicates break the rules) [Morris,M on Russell]
Classes are defined by propositional functions, and functions are typed, with an axiom of reducibility [Russell, by Lackey]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / a. Constructivism
We could accept the integers as primitive, then use sets to construct the rest [Cohen]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
A one-variable function is only 'predicative' if it is one order above its arguments [Russell]