Combining Philosophers

All the ideas for Anon (Lev), Marcus Rossberg and Leslie H. Tharp

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

27 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]
10751 Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg]
10757 Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg]
10759 There are at least seven possible systems of semantics for second-order logic [Rossberg]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
10753 Logical consequence is intuitively semantic, and captured by model theory [Rossberg]
5. Theory of Logic / B. Logical Consequence / 3. Deductive Consequence |-
10752 Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
10754 In proof-theory, logical form is shown by the logical constants [Rossberg]
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 / 1. Logical Models
10756 A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg]
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
10758 If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg]
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]
10761 Completeness can always be achieved by cunning model-design [Rossberg]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
10770 If completeness fails there is no algorithm to list the valid formulas [Tharp]
10755 A deductive system is only incomplete with respect to a formal semantics [Rossberg]
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]
22. Metaethics / B. Value / 2. Values / g. Love
19941 Thou shalt love thy neighbour as thyself [Anon (Leviticus)]