Combining Texts

All the ideas for 'Which Logic is the Right Logic?', 'Law and Causality' and 'Introduction to Philosophical Papers I'

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


22 ideas

1. Philosophy / E. Nature of Metaphysics / 3. Metaphysical Systems
I tried to be unsystematic and piecemeal, but failed; my papers presuppose my other views [Lewis]
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 / 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 / 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 / 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]
10. Modality / B. Possibility / 8. Conditionals / d. Non-truthfunction conditionals
Ramsey's Test: believe the consequent if you believe the antecedent [Ramsey, by Read]
10. Modality / B. Possibility / 8. Conditionals / e. Supposition conditionals
Asking 'If p, will q?' when p is uncertain, then first add p hypothetically to your knowledge [Ramsey]
14. Science / B. Scientific Theories / 8. Ramsey Sentences
Mental terms can be replaced in a sentence by a variable and an existential quantifier [Ramsey]
26. Natural Theory / D. Laws of Nature / 4. Regularities / b. Best system theory
All knowledge needs systematizing, and the axioms would be the laws of nature [Ramsey]
Causal laws result from the simplest axioms of a complete deductive system [Ramsey]