68 ideas
| 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] |
| 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] |
| 12887 | A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 13047 | It is knowing 'why' that gives scientific understanding, not knowing 'that' [Salmon] |
| 13065 | Understanding is an extremely vague concept [Salmon] |
| 13054 | Correlations can provide predictions, but only causes can give explanations [Salmon] |
| 13067 | For the instrumentalists there are no scientific explanations [Salmon] |
| 13055 | Good induction needs 'total evidence' - the absence at the time of any undermining evidence [Salmon] |
| 13046 | Scientific explanation is not reducing the unfamiliar to the familiar [Salmon] |
| 13058 | Why-questions can seek evidence as well as explanation [Salmon] |
| 14366 | An explanation is a table of statistical information [Salmon, by Strevens] |
| 13064 | The three basic conceptions of scientific explanation are modal, epistemic, and ontic [Salmon] |
| 13050 | The 'inferential' conception is that all scientific explanations are arguments [Salmon] |
| 13059 | Ontic explanations can be facts, or reports of facts [Salmon] |
| 13049 | We must distinguish true laws because they (unlike accidental generalizations) explain things [Salmon] |
| 13051 | Deductive-nomological explanations will predict, and their predictions will explain [Salmon] |
| 13053 | A law is not enough for explanation - we need information about what makes a difference [Salmon] |
| 13061 | Flagpoles explain shadows, and not vice versa, because of temporal ordering [Salmon] |
| 17093 | Causation produces productive mechanisms; to understand the world, understand these mechanisms [Salmon] |
| 17492 | Salmon's interaction mechanisms needn't be regular, or involving any systems [Glennan on Salmon] |
| 13045 | Explanation at the quantum level will probably be by entirely new mechanisms [Salmon] |
| 13062 | Does an item have a function the first time it occurs? [Salmon] |
| 13063 | Explanations reveal the mechanisms which produce the facts [Salmon] |
| 16557 | Salmon's mechanisms are processes and interactions, involving marks, or conserved quantities [Salmon, by Machamer/Darden/Craver] |
| 13060 | Can events whose probabilities are low be explained? [Salmon] |
| 13056 | Statistical explanation needs relevance, not high probability [Salmon] |
| 13057 | Think of probabilities in terms of propensities rather than frequencies [Salmon] |
| 8412 | A causal interaction is when two processes intersect, and correlated modifications persist afterwards [Salmon] |
| 8413 | Cause must come first in propagations of causal interactions, but interactions are simultaneous [Salmon] |
| 8411 | Instead of localised events, I take enduring and extended processes as basic to causation [Salmon] |
| 4784 | Salmon says processes rather than events should be basic in a theory of physical causation [Salmon, by Psillos] |
| 8409 | Probabilistic causal concepts are widely used in everyday life and in science [Salmon] |