Combining Texts

All the ideas for 'Review of Bob Hale's 'Abstract Objects'', 'Truth and Meaning' and 'Which Logic is the Right Logic?'

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

23 ideas

1. Philosophy / F. Analytic Philosophy / 4. Conceptual Analysis
9184 We can't presume that all interesting concepts can be analysed [Williamson]
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 / 1. Logical Form
7332 There is a huge range of sentences of which we do not know the logical form [Davidson]
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]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
9183 Platonism claims that some true assertions have singular terms denoting abstractions, so abstractions exist [Williamson]
19. Language / C. Assigning Meanings / 4. Compositionality
7772 Compositionality explains how long sentences work, and truth conditions are the main compositional feature [Davidson, by Lycan]
19. Language / C. Assigning Meanings / 5. Fregean Semantics
7327 Davidson thinks Frege lacks an account of how words create sentence-meaning [Davidson, by Miller,A]
19. Language / C. Assigning Meanings / 9. Indexical Semantics
7769 You can state truth-conditions for "I am sick now" by relativising it to a speaker at a time [Davidson, by Lycan]
19. Language / F. Communication / 6. Interpreting Language / b. Indeterminate translation
6179 Should we assume translation to define truth, or the other way around? [Blackburn on Davidson]