66 ideas
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [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] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| 13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
| 13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
| 13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [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] |
| 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] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [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] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [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] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [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] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 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] |
| 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] |
| 12154 | Are 'word token' and 'word type' different sorts of countable objects, or two ways of counting? [Geach, by Perry] |
| 10735 | Abstraction from objects won't reveal an operation's being performed 'so many times' [Geach] |
| 8780 | Attributes are functions, not objects; this distinguishes 'square of 2' from 'double of 2' [Geach] |
| 8969 | We should abandon absolute identity, confining it to within some category [Geach, by Hawthorne] |
| 16075 | Denial of absolute identity has drastic implications for logic, semantics and set theory [Wasserman on Geach] |
| 12152 | Identity is relative. One must not say things are 'the same', but 'the same A as' [Geach] |
| 16073 | Leibniz's Law is incomplete, since it includes a non-relativized identity predicate [Geach, by Wasserman] |
| 11910 | Being 'the same' is meaningless, unless we specify 'the same X' [Geach] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 8775 | A big flea is a small animal, so 'big' and 'small' cannot be acquired by abstraction [Geach] |
| 8776 | We cannot learn relations by abstraction, because their converse must be learned too [Geach] |
| 10732 | If concepts are just recognitional, then general judgements would be impossible [Geach] |
| 2567 | You can't define real mental states in terms of behaviour that never happens [Geach] |
| 2568 | Beliefs aren't tied to particular behaviours [Geach] |
| 8781 | The mind does not lift concepts from experience; it creates them, and then applies them [Geach] |
| 10731 | For abstractionists, concepts are capacities to recognise recurrent features of the world [Geach] |
| 8769 | If someone has aphasia but can still play chess, they clearly have concepts [Geach] |
| 8770 | 'Abstractionism' is acquiring a concept by picking out one experience amongst a group [Geach] |
| 8771 | 'Or' and 'not' are not to be found in the sensible world, or even in the world of inner experience [Geach] |
| 8772 | We can't acquire number-concepts by extracting the number from the things being counted [Geach] |
| 8773 | Abstractionists can't explain counting, because it must precede experience of objects [Geach] |
| 8774 | The numbers don't exist in nature, so they cannot have been abstracted from there into our languages [Geach] |
| 8778 | Blind people can use colour words like 'red' perfectly intelligently [Geach] |
| 8777 | If 'black' and 'cat' can be used in the absence of such objects, how can such usage be abstracted? [Geach] |
| 8779 | We can form two different abstract concepts that apply to a single unified experience [Geach] |
| 10733 | The abstractionist cannot explain 'some' and 'not' [Geach] |
| 10734 | Only a judgement can distinguish 'striking' from 'being struck' [Geach] |
| 22489 | 'Good' is an attributive adjective like 'large', not predicative like 'red' [Geach, by Foot] |
| 1558 | Clearly the gods ignore human affairs, or they would have given us justice [Thrasymachus] |