74 ideas
| 10633 | 'Some critics admire only one another' cannot be paraphrased in singular first-order [Linnebo] |
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
| 9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
| 13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
| 9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
| 9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
| 13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton] |
| 13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
| 9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
| 9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
| 9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
| 9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
| 9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
| 9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
| 9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
| 13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
| 13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
| 13203 | The singleton is defined using the pairing axiom (as {x,x}) [Enderton] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
| 13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
| 10779 | A comprehension axiom is 'predicative' if the formula has no bound second-order variables [Linnebo] |
| 23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 10781 | A 'pure logic' must be ontologically innocent, universal, and without presuppositions [Linnebo] |
| 10638 | A pure logic is wholly general, purely formal, and directly known [Linnebo] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 10783 | Plural quantification depends too heavily on combinatorial and set-theoretic considerations [Linnebo] |
| 10635 | Second-order quantification and plural quantification are different [Linnebo] |
| 10641 | Traditionally we eliminate plurals by quantifying over sets [Linnebo] |
| 10640 | Instead of complex objects like tables, plurally quantify over mereological atoms tablewise [Linnebo] |
| 10778 | Can second-order logic be ontologically first-order, with all the benefits of second-order? [Linnebo] |
| 10636 | Plural plurals are unnatural and need a first-level ontology [Linnebo] |
| 10639 | Plural quantification may allow a monadic second-order theory with first-order ontology [Linnebo] |
| 23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
| 9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| 23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
| 23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
| 9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
| 9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| 9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
| 9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
| 23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
| 23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
| 14085 | 'Deductivist' structuralism is just theories, with no commitment to objects, or modality [Linnebo] |
| 14084 | Non-eliminative structuralism treats mathematical objects as positions in real abstract structures [Linnebo] |
| 14086 | 'Modal' structuralism studies all possible concrete models for various mathematical theories [Linnebo] |
| 14087 | 'Set-theoretic' structuralism treats mathematics as various structures realised among the sets [Linnebo] |
| 14089 | Structuralism differs from traditional Platonism, because the objects depend ontologically on their structure [Linnebo] |
| 14083 | Structuralism is right about algebra, but wrong about sets [Linnebo] |
| 14090 | In mathematical structuralism the small depends on the large, which is the opposite of physical structures [Linnebo] |
| 23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
| 23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
| 16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
| 14091 | There may be a one-way direction of dependence among sets, and among natural numbers [Linnebo] |
| 16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
| 16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
| 16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
| 10643 | We speak of a theory's 'ideological commitments' as well as its 'ontological commitments' [Linnebo] |
| 10637 | Ordinary speakers posit objects without concern for ontology [Linnebo] |
| 14088 | An 'intrinsic' property is either found in every duplicate, or exists independent of all externals [Linnebo] |
| 10782 | The modern concept of an object is rooted in quantificational logic [Linnebo] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 10634 | Predicates are 'distributive' or 'non-distributive'; do individuals do what the group does? [Linnebo] |