35 ideas
| 9572 | Realists about sets say there exists a null set in the real world, with no members [Chihara] |
| 9550 | We only know relational facts about the empty set, but nothing intrinsic [Chihara] |
| 9562 | In simple type theory there is a hierarchy of null sets [Chihara] |
| 9573 | The null set is a structural position which has no other position in membership relation [Chihara] |
| 9551 | What is special about Bill Clinton's unit set, in comparison with all the others? [Chihara] |
| 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] |
| 9549 | The set theorist cannot tell us what 'membership' is [Chihara] |
| 9571 | ZFU refers to the physical world, when it talks of 'urelements' [Chihara] |
| 18151 | Could we replace sets by the open sentences that define them? [Chihara, by Bostock] |
| 9563 | A pack of wolves doesn't cease when one member dies [Chihara] |
| 8758 | We could talk of open sentences, instead of sets [Chihara, by Shapiro] |
| 9561 | The mathematics of relations is entirely covered by ordered pairs [Chihara] |
| 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] |
| 10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
| 10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
| 9552 | Sentences are consistent if they can all be true; for Frege it is that no contradiction can be deduced [Chihara] |
| 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] |
| 9553 | Analytic geometry gave space a mathematical structure, which could then have axioms [Chihara] |
| 10192 | We can replace existence of sets with possibility of constructing token sentences [Chihara, by MacBride] |
| 10265 | Chihara's system is a variant of type theory, from which he can translate sentences [Chihara, by Shapiro] |
| 8759 | We can replace type theory with open sentences and a constructibility quantifier [Chihara, by Shapiro] |
| 10264 | Introduce a constructibility quantifiers (Cx)Φ - 'it is possible to construct an x such that Φ' [Chihara, by Shapiro] |
| 9559 | If a successful theory confirms mathematics, presumably a failed theory disconfirms it? [Chihara] |
| 9566 | No scientific explanation would collapse if mathematical objects were shown not to exist [Chihara] |
| 9568 | I prefer the open sentences of a Constructibility Theory, to Platonist ideas of 'equivalence classes' [Chihara] |
| 9547 | Mathematical entities are causally inert, so the causal theory of reference won't work for them [Chihara] |
| 7810 | The 'Eumenides' of Aeschylus shows blood feuds replaced by law [Aeschylus, by Grayling] |
| 9574 | 'Gunk' is an individual possessing no parts that are atoms [Chihara] |