32 ideas
10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
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] |
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] |
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] |
9175 | We may fix the reference of 'Cicero' by a description, but thereafter the name is rigid [Kripke] |
9171 | The function of names is simply to refer [Kripke] |
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] |
17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
17890 | There are at least eleven types of large cardinal, of increasing logical strength [Koellner] |
17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
17891 | Arithmetical undecidability is always settled at the next stage up [Koellner] |
9174 | It is necessary that this table is not made of ice, but we don't know it a priori [Kripke] |
9172 | A 'rigid designator' designates the same object in all possible worlds [Kripke] |
9173 | We cannot say that Nixon might have been a different man from the one he actually was [Kripke] |
9176 | Modal statements about this table never refer to counterparts; that confuses epistemology and metaphysics [Kripke] |
9177 | Identity theorists must deny that pains can be imagined without brain states [Kripke] |
9178 | Pain, unlike heat, is picked out by an essential property [Kripke] |