Combining Texts

All the ideas for 'fragments/reports', 'Higher-Order Logic' and 'Which Logic is the Right Logic?'

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


30 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]
The axiom of choice is controversial, but it could be replaced [Shapiro]
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]
First-order logic is Complete, and Compact, with the Löwenheim-Skolem Theorems [Shapiro]
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]
Some say that second-order logic is mathematics, not logic [Shapiro]
If the aim of logic is to codify inferences, second-order logic is useless [Shapiro]
5. Theory of Logic / B. Logical Consequence / 1. Logical Consequence
Logical consequence can be defined in terms of the logical terminology [Shapiro]
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 / 5. Second-Order Quantification
Second-order variables also range over properties, sets, relations or functions [Shapiro]
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]
The Löwenheim-Skolem theorem seems to be a defect of first-order logic [Shapiro]
Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp]
Up Löwenheim-Skolem: if natural numbers satisfy wffs, then an infinite domain satisfies them [Shapiro]
Downward Löwenheim-Skolem: if there's an infinite model, there is a countable model [Shapiro]
The Löwenheim-Skolem Theorems fail for second-order languages with standard semantics [Shapiro]
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 / 4. Axioms for Number / e. Peano arithmetic 2nd-order
Second-order logic has the expressive power for mathematics, but an unworkable model theory [Shapiro]
8. Modes of Existence / B. Properties / 11. Properties as Sets
Logicians use 'property' and 'set' interchangeably, with little hanging on it [Shapiro]
26. Natural Theory / A. Speculations on Nature / 5. Infinite in Nature
Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius]
27. Natural Reality / G. Biology / 3. Evolution
Archelaus said life began in a primeval slime [Archelaus, by Schofield]