31 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] |
10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
13030 | Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y) [Kunen] |
13032 | Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z) [Kunen] |
13033 | Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A) [Kunen] |
13037 | Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x) [Kunen] |
13038 | Power Set: ∀x ∃y ∀z(z ⊂ x → z ∈ y) [Kunen] |
13034 | Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen] |
13039 | Foundation:∀x(∃y(y∈x) → ∃y(y∈x ∧ ¬∃z(z∈x ∧ z∈y))) [Kunen] |
13036 | Choice: ∀A ∃R (R well-orders A) [Kunen] |
13029 | Set Existence: ∃x (x = x) [Kunen] |
10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
13031 | Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen] |
13040 | Constructibility: V = L (all sets are constructible) [Kunen] |
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] |
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] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
3570 | Maybe knowledge is belief which 'tracks' the truth [Nozick, by Williams,M] |
2748 | A true belief isn't knowledge if it would be believed even if false. It should 'track the truth' [Nozick, by Dancy,J] |