Combining Philosophers

All the ideas for Charles Parsons, Leslie H. Tharp and Iamblichus

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

25 ideas

4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
9470 Modal logic is not an extensional language [Parsons,C]
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]
13418 The old problems with the axiom of choice are probably better ascribed to the law of excluded middle [Parsons,C]
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 / 4. Substitutional Quantification
9469 Substitutional existential quantifier may explain the existence of linguistic entities [Parsons,C]
9468 On the substitutional interpretation, '(∃x) Fx' is true iff a closed term 't' makes Ft true [Parsons,C]
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]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / c. Counting procedure
17447 Parsons says counting is tagging as first, second, third..., and converting the last to a cardinal [Parsons,C, by Heck]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / c. Against mathematical empiricism
18201 General principles can be obvious in mathematics, but bold speculations in empirical science [Parsons,C]
6. Mathematics / C. Sources of Mathematics / 8. Finitism
13419 If functions are transfinite objects, finitists can have no conception of them [Parsons,C]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
13417 If a mathematical structure is rejected from a physical theory, it retains its mathematical status [Parsons,C]
28. God / A. Divine Nature / 6. Divine Morality / b. Euthyphro question
1515 Pythagoreans believe it is absurd to seek for goodness anywhere except with the gods [Iamblichus]