Combining Texts

All the ideas for 'Why coherence is not enough', 'Philosophy of Mathematics' and 'Which Logic is the Right Logic?'

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

22 ideas

2. Reason / D. Definition / 8. Impredicative Definition
10882 Predicative definitions only refer to entities outside the defined collection [Horsten]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
10775 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
10766 Logic is either for demonstration, or for characterizing structures [Tharp]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
10767 Elementary logic is complete, but cannot capture mathematics [Tharp]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
10769 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
10762 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
10776 The main quantifiers extend 'and' and 'or' to infinite domains [Tharp]
5. Theory of Logic / G. Quantification / 7. Unorthodox Quantification
10774 There are at least five unorthodox quantifiers that could be used [Tharp]
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
10884 A theory is 'categorical' if it has just one model up to isomorphism [Horsten]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
10773 The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp]
10777 Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp]
5. Theory of Logic / K. Features of Logics / 3. Soundness
10765 Soundness would seem to be an essential requirement of a proof procedure [Tharp]
5. Theory of Logic / K. Features of Logics / 4. Completeness
10763 Completeness and compactness together give axiomatizability [Tharp]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
10770 If completeness fails there is no algorithm to list the valid formulas [Tharp]
5. Theory of Logic / K. Features of Logics / 6. Compactness
10771 Compactness is important for major theories which have infinitely many axioms [Tharp]
10772 Compactness blocks infinite expansion, and admits non-standard models [Tharp]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
10764 A complete logic has an effective enumeration of the valid formulas [Tharp]
10768 Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp]
6. Mathematics / B. Foundations for Mathematics / 2. Proof in Mathematics
10885 Computer proofs don't provide explanations [Horsten]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
10881 The concept of 'ordinal number' is set-theoretic, not arithmetical [Horsten]
13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / a. Agrippa's trilemma
8840 There are five possible responses to the problem of infinite regress in justification [Cleve]
13. Knowledge Criteria / B. Internal Justification / 4. Foundationalism / a. Foundationalism
8841 Modern foundationalists say basic beliefs are fallible, and coherence is relevant [Cleve]