Combining Texts

All the ideas for 'Logical Consequence', 'Which Logic is the Right Logic?' and 'On 'Generation and Corruption''

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


25 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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is either for demonstration, or for characterizing structures [Tharp]
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 / A. Overview of Logic / 5. First-Order Logic
Elementary logic is complete, but cannot capture mathematics [Tharp]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order logic isn't provable, but will express set-theory and classic problems [Tharp]
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 / 2. Logical Connectives / b. Basic connectives
In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp]
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
The main quantifiers extend 'and' and 'or' to infinite domains [Tharp]
5. Theory of Logic / G. Quantification / 7. Unorthodox Quantification
There are at least five unorthodox quantifiers that could be used [Tharp]
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 / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp]
The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp]
5. Theory of Logic / K. Features of Logics / 3. Soundness
Soundness would seem to be an essential requirement of a proof procedure [Tharp]
5. Theory of Logic / K. Features of Logics / 4. Completeness
Completeness and compactness together give axiomatizability [Tharp]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
If completeness fails there is no algorithm to list the valid formulas [Tharp]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Compactness is important for major theories which have infinitely many axioms [Tharp]
Compactness blocks infinite expansion, and admits non-standard models [Tharp]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
A complete logic has an effective enumeration of the valid formulas [Tharp]
Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp]
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]
26. Natural Theory / A. Speculations on Nature / 6. Early Matter Theories / f. Ancient elements
Elements are found last in dismantling bodies, and first in generating them [Albert of Saxony]