Combining Philosophers

All the ideas for John Buridan, Juan Comesaa and Leslie H. Tharp

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

25 ideas

2. Reason / A. Nature of Reason / 9. Limits of Reason
1403 A rational donkey would starve to death between two totally identical piles of hay [Buridan, by PG]
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 / 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]
9. Objects / C. Structure of Objects / 4. Quantity of an Object
16678 Without magnitude a thing would retain its parts, but they would have no location [Buridan]
9. Objects / E. Objects over Time / 8. Continuity of Rivers
16793 A thing is (less properly) the same over time if each part is succeeded by another [Buridan]
12. Knowledge Sources / B. Perception / 2. Qualities in Perception / b. Primary/secondary
16726 Why can't we deduce secondary qualities from primary ones, if they cause them? [Buridan]
13. Knowledge Criteria / C. External Justification / 3. Reliabilism / a. Reliable knowledge
19727 Reliabilist knowledge is evidence based belief, with high conditional probability [Comesaña]
13. Knowledge Criteria / C. External Justification / 3. Reliabilism / b. Anti-reliabilism
19725 In a sceptical scenario belief formation is unreliable, so no beliefs at all are justified? [Comesaña]
19726 How do we decide which exact process is the one that needs to be reliable? [Comesaña]
14. Science / A. Basis of Science / 2. Demonstration
16577 Induction is not demonstration, because not all of the instances can be observed [Buridan]
14. Science / C. Induction / 2. Aims of Induction
16576 Science is based on induction, for general truths about fire, rhubarb and magnets [Buridan]