Combining Texts

All the ideas for 'Reply to Professor Marcus', 'Models' and 'Which Logic is the Right Logic?'

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


24 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 / 4. Substitutional Quantification
Either reference really matters, or we don't need to replace it with substitutions [Quine]
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]
14. Science / B. Scientific Theories / 7. Scientific Models
Theoretical models can represent, by mapping onto the data-models [Portides]
In the 'received view' models are formal; the 'semantic view' emphasises representation [Portides, by PG]
Representational success in models depends on success of their explanations [Portides]
The best model of the atomic nucleus is the one which explains the most results [Portides]
'Model' belongs in a family of concepts, with representation, idealisation and abstraction [Portides]
Models are theory-driven, or phenomenological (more empirical and specific) [Portides]
14. Science / D. Explanation / 2. Types of Explanation / i. Explanations by mechanism
General theories may be too abstract to actually explain the mechanisms [Portides]