30 ideas
10807 | Mathematics reduces to set theory, which reduces, with some mereology, to the singleton function [Lewis] |
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] |
10809 | We can accept the null set, but not a null class, a class lacking members [Lewis] |
10811 | The null set plays the role of last resort, for class abstracts and for existence [Lewis] |
10812 | The null set is not a little speck of sheer nothingness, a black hole in Reality [Lewis] |
10813 | What on earth is the relationship between a singleton and an element? [Lewis] |
10814 | Are all singletons exact intrinsic duplicates? [Lewis] |
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] |
10806 | Megethology is the result of adding plural quantification to mereology [Lewis] |
10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
10816 | We can use mereology to simulate quantification over relations [Lewis] |
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] |
10808 | Mathematics is generalisations about singleton functions [Lewis] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
10815 | We don't need 'abstract structures' to have structural truths about successor functions [Lewis] |
10810 | I say that absolutely any things can have a mereological fusion [Lewis] |
5994 | Is the cosmos open or closed, mechanical or teleological, alive or inanimate, and created or eternal? [Robinson,TM, by PG] |