Combining Philosophers

All the ideas for Rayo,A/Uzquiasno,G, Stephen R. Grimm and Leslie H. Tharp

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

25 ideas

4. Formal Logic / F. Set Theory ST / 1. Set Theory
13451 The two best understood conceptions of set are the Iterative and the Limitation of Size [Rayo/Uzquiano]
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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / m. Axiom of Separation
13452 Some set theories give up Separation in exchange for a universal set [Rayo/Uzquiano]
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]
13449 We could have unrestricted quantification without having an all-inclusive domain [Rayo/Uzquiano]
13450 Absolute generality is impossible, if there are indefinitely extensible concepts like sets and ordinals [Rayo/Uzquiano]
5. Theory of Logic / G. Quantification / 5. Second-Order Quantification
13453 Perhaps second-order quantifications cover concepts of objects, rather than plain objects [Rayo/Uzquiano]
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 / 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]
11. Knowledge Aims / A. Knowledge / 2. Understanding
19691 Unlike knowledge, you can achieve understanding through luck [Grimm]
19690 'Grasping' a structure seems to be modal, because we must anticipate its behaviour [Grimm]
19692 You may have 'weak' understanding, if by luck you can answer a set of 'why questions' [Grimm]
19. Language / F. Communication / 5. Pragmatics / a. Contextual meaning
13448 The domain of an assertion is restricted by context, either semantically or pragmatically [Rayo/Uzquiano]