Combining Texts

All the ideas for 'Causes and Counterfactuals', 'The Secret Connexion' and 'Which Logic is the Right Logic?'

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


22 ideas

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
The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp]
Skolem mistakenly inferred that Cantor's conceptions were illusory [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]
26. Natural Theory / C. Causation / 1. Causation
Causal statements are used to explain, to predict, to control, to attribute responsibility, and in theories [Kim]
26. Natural Theory / C. Causation / 9. General Causation / a. Constant conjunction
A phenomenalist about objects has to be a regularity theorist about causation [Strawson,G]
26. Natural Theory / C. Causation / 9. General Causation / c. Counterfactual causation
Many counterfactuals have nothing to do with causation [Kim, by Tooley]
Counterfactuals can express four other relations between events, apart from causation [Kim]
Causation is not the only dependency relation expressed by counterfactuals [Kim]
26. Natural Theory / D. Laws of Nature / 9. Counterfactual Claims
Many counterfactual truths do not imply causation ('if yesterday wasn't Monday, it isn't Tuesday') [Kim, by Psillos]