37 ideas
| 15053 | If metaphysics can't be settled, it hardly matters whether it makes sense [Fine,K] |
| 15054 | 'Quietist' says abandon metaphysics because answers are unattainable (as in Kant's noumenon) [Fine,K] |
| 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] |
| 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] |
| 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] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all 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] |
| 8921 | Structuralism is now common, studying relations, with no regard for what the objects might be [Hellman] |
| 8922 | Maybe mathematical objects only have structural roles, and no intrinsic nature [Hellman] |
| 15007 | If you make 'grounding' fundamental, you have to mention some non-fundamental notions [Sider on Fine,K] |
| 15006 | Something is grounded when it holds, and is explained, and necessitated by something else [Fine,K, by Sider] |
| 15055 | Grounding relations are best expressed as relations between sentences [Fine,K] |
| 15050 | Reduction might be producing a sentence which gets closer to the logical form [Fine,K] |
| 15051 | Reduction might be semantic, where a reduced sentence is understood through its reduction [Fine,K] |
| 15052 | Reduction is modal, if the reductions necessarily entail the truth of the target sentence [Fine,K] |
| 15056 | The notion of reduction (unlike that of 'ground') implies the unreality of what is reduced [Fine,K] |
| 15046 | Reality is a primitive metaphysical concept, which cannot be understood in other terms [Fine,K] |
| 15047 | What is real can only be settled in terms of 'ground' [Fine,K] |
| 15048 | In metaphysics, reality is regarded as either 'factual', or as 'fundamental' [Fine,K] |
| 15060 | Why should what is explanatorily basic be therefore more real? [Fine,K] |
| 15061 | Although colour depends on us, we can describe the world that way if it picks out fundamentals [Fine,K] |
| 15059 | Grounding is an explanation of truth, and needs all the virtues of good explanations [Fine,K] |
| 15057 | Ultimate explanations are in 'grounds', which account for other truths, which hold in virtue of the grounding [Fine,K] |
| 15058 | A proposition ingredient is 'essential' if changing it would change the truth-value [Fine,K] |