Combining Philosophers

All the ideas for Rescher,N/Oppenheim,P, Leslie H. Tharp and William Poundstone

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

24 ideas

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
10777 Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp]
10773 The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [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 / 8. Parts of Objects / c. Wholes from parts
12887 A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim]
23. Ethics / B. Contract Ethics / 1. Contractarianism
22717 Self-interest can fairly divide a cake; first person cuts, second person chooses [Poundstone]
23. Ethics / B. Contract Ethics / 6. Game Theory
22718 Formal game theory is about maximising or minimising numbers in tables [Poundstone]
22719 The minimax theorem says a perfect game of opposed people always has a rational solution [Poundstone]
23. Ethics / B. Contract Ethics / 7. Prisoner's Dilemma
22720 Two prisoners get the best result by being loyal, not by selfish betrayal [Poundstone]
22721 The tragedy in prisoner's dilemma is when two 'nice' players misread each other [Poundstone]
23. Ethics / B. Contract Ethics / 8. Contract Strategies
22722 TIT FOR TAT says cooperate at first, then do what the other player does [Poundstone]
22723 Do unto others as you would have them do unto you - or else! [Poundstone]