26 ideas
18901 | Truthmakers are facts 'of' a domain, not something 'in' the domain [Sommers] |
18904 | 'Predicable' terms come in charged pairs, with one the negation of the other [Sommers, by Engelbretsen] |
18895 | Logic which maps ordinary reasoning must be transparent, and free of variables [Sommers] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
10594 | Henkin semantics is more plausible for plural logic than for second-order logic [Maddy] |
18897 | Predicate logic has to spell out that its identity relation '=' is an equivalent relation [Sommers] |
18893 | Translating into quantificational idiom offers no clues as to how ordinary thinkers reason [Sommers] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
18903 | Sommers promotes the old idea that negation basically refers to terms [Sommers, by Engelbretsen] |
18894 | Predicates form a hierarchy, from the most general, down to names at the bottom [Sommers] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
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] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
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] |
18900 | Unfortunately for realists, modern logic cannot say that some fact exists [Sommers] |
18898 | In standard logic, names are the only way to refer [Sommers] |