26 ideas
10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
7785 | The use of plurals doesn't commit us to sets; there do not exist individuals and collections [Boolos] |
10699 | Does a bowl of Cheerios contain all its sets and subsets? [Boolos] |
10225 | Monadic second-order logic might be understood in terms of plural quantifiers [Boolos, by Shapiro] |
10736 | Boolos showed how plural quantifiers can interpret monadic second-order logic [Boolos, by Linnebo] |
10780 | Any sentence of monadic second-order logic can be translated into plural first-order logic [Boolos, by Linnebo] |
10697 | Identity is clearly a logical concept, and greatly enhances predicate calculus [Boolos] |
13671 | Second-order quantifiers are just like plural quantifiers in ordinary language, with no extra ontology [Boolos, by Shapiro] |
10267 | We should understand second-order existential quantifiers as plural quantifiers [Boolos, by Shapiro] |
10698 | Plural forms have no more ontological commitment than to first-order objects [Boolos] |
7806 | Boolos invented plural quantification [Boolos, by Benardete,JA] |
10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
10700 | First- and second-order quantifiers are two ways of referring to the same things [Boolos] |
17371 | Some kinds are very explanatory, but others less so, and some not at all [Devitt] |
17373 | Species pluralism says there are several good accounts of what a species is [Devitt] |
17372 | The higher categories are not natural kinds, so the Linnaean hierarchy should be given up [Devitt] |