Combining Texts

All the ideas for 'On Mind (frags)', 'How to Define Theoretical Terms' and 'Which Logic is the Right Logic?'

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


23 ideas

2. Reason / D. Definition / 2. Aims of Definition
Defining terms either enables elimination, or shows that they don't require elimination [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 / A. Necessity / 8. Transcendental Necessity
Everything happens by reason and necessity [Leucippus]
10. Modality / E. Possible worlds / 3. Transworld Objects / b. Rigid designation
A logically determinate name names the same thing in every possible world [Lewis]
14. Science / B. Scientific Theories / 8. Ramsey Sentences
The Ramsey sentence of a theory says that it has at least one realisation [Lewis]
A Ramsey sentence just asserts that a theory can be realised, without saying by what [Lewis]
There is a method for defining new scientific terms just using the terms we already understand [Lewis]
It is better to have one realisation of a theory than many - but it may not always be possible [Lewis]