28 ideas
21704 | 'Impredictative' definitions fix a class in terms of the greater class to which it belongs [Linsky,B] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
21705 | Reducibility says any impredicative function has an appropriate predicative replacement [Linsky,B] |
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] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
21727 | Definite descriptions theory eliminates the King of France, but not the Queen of England [Linsky,B] |
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] |
21719 | Extensionalism means what is true of a function is true of coextensive functions [Linsky,B] |
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] |
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] |
21723 | The task of logicism was to define by logic the concepts 'number', 'successor' and '0' [Linsky,B] |
21721 | Higher types are needed to distinguished intensional phenomena which are coextensive [Linsky,B] |
21703 | Types are 'ramified' when there are further differences between the type of quantifier and its range [Linsky,B] |
21714 | The ramified theory subdivides each type, according to the range of the variables [Linsky,B] |
21713 | Did logicism fail, when Russell added three nonlogical axioms, to save mathematics? [Linsky,B] |
21715 | For those who abandon logicism, standard set theory is a rival option [Linsky,B] |
21729 | Construct properties as sets of objects, or say an object must be in the set to have the property [Linsky,B] |
21650 | No language is semantically referential; it all occurs at the level of thought or utterance [Pietroski, by Hofweber] |