41 ideas
10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
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] |
10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
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] |
10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
9561 | The mathematics of relations is entirely covered by ordered pairs [Chihara] |
10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
10900 | Logically true sentences are true in all structures [Zalabardo] |
10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
9552 | Sentences are consistent if they can all be true; for Frege it is that no contradiction can be deduced [Chihara] |
9553 | Analytic geometry gave space a mathematical structure, which could then have axioms [Chihara] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
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] |
20919 | How can things without weight compose weight? [Alexander] |
9574 | 'Gunk' is an individual possessing no parts that are atoms [Chihara] |