40 ideas
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| Full Idea: Until the 1960s standard truth-table semantics were the only ones that there were. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.10.1) | |
| A reaction: The 1960s presumably marked the advent of possible worlds. |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| Full Idea: 'dom R' indicates the 'domain' of a relation, that is, the set of all objects that are members of ordered pairs and that have that relation. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
| Full Idea: 'fld R' indicates the 'field' of a relation, that is, the set of all objects that are members of ordered pairs on either side of the relation. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
| Full Idea: 'ran R' indicates the 'range' of a relation, that is, the set of all objects that are members of ordered pairs and that are related to by the first objects. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| Full Idea: We write F : A → B to indicate that A maps into B, that is, the domain of relating things is set A, and the things related to are all in B. If we add that F = B, then A maps 'onto' B. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
|
Full Idea:
F(x) is a 'function', which indicates the unique value which y takes in |
|
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
| Full Idea: A relation is 'symmetric' on a set if every ordered pair in the set has the relation in both directions. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
| Full Idea: A relation is 'transitive' on a set if the relation can be carried over from two ordered pairs to a third. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
| Full Idea: The 'powerset' of a set is all the subsets of a given set. Thus: PA = {x : x ⊆ A}. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
| Full Idea: Two sets are 'disjoint' iff their intersection is empty (i.e. they have no members in common). | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| Full Idea: The 'domain' of a relation is the set of all objects that are members of ordered pairs that are members of the relation. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| Full Idea: A 'relation' is a set of ordered pairs. The ordering relation on the numbers 0-3 is captured by - in fact it is - the set of ordered pairs {<0,1>,<0,2>,<0,3>,<1,2>,<1,3>,<2,3>}. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) | |
| A reaction: This can't quite be a definition of order among numbers, since it relies on the notion of a 'ordered' pair. |
| 9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
| Full Idea: A 'function' is a relation which is single-valued. That is, for each object, there is only one object in the function set to which that object is related. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
| Full Idea: A function 'maps A into B' if the domain of relating things is set A, and the things related to are all in B. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
| Full Idea: A function 'maps A onto B' if the domain of relating things is set A, and the things related to are set B. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
| Full Idea: A relation is 'reflexive' on a set if every member of the set bears the relation to itself. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
| Full Idea: A relation satisfies 'trichotomy' on a set if every ordered pair is related (in either direction), or the objects are identical. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
| Full Idea: A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| Full Idea: An 'equivalence relation' is a binary relation which is reflexive, and symmetric, and transitive. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| Full Idea: Equivalence classes will 'partition' a set. That is, it will divide it into distinct subsets, according to each relation on the set. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| Full Idea: The process is dubbed 'conversational implicature' when the inference is not from the content of what has been said, but from the fact that it has been said. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.7.3) |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| Full Idea: The point of logic is to give an account of the notion of validity,..in two standard ways: the semantic way says that a valid inference preserves truth (symbol |=), and the proof-theoretic way is defined in terms of purely formal procedures (symbol |-). | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.1.3..) | |
| A reaction: This division can be mirrored in mathematics, where it is either to do with counting or theorising about things in the physical world, or following sets of rules from axioms. Language can discuss reality, or play word-games. |
| 9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
| Full Idea: A is a logical truth (tautology) (|= A) iff it is a semantic consequence of the empty set of premises (φ |= A), that is, every interpretation makes A true. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.3.4) | |
| A reaction: So the final column of every line of the truth table will be T. |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| Full Idea: A truth assignment 'satisfies' a formula, or set of formulae, if it evaluates as True when all of its components have been assigned truth values. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.2) | |
| A reaction: [very roughly what Enderton says!] The concept becomes most significant when a large set of wff's is pronounced 'satisfied' after a truth assignment leads to them all being true. |
| 9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
| Full Idea: If every proof-theoretically valid inference is semantically valid (so that |- entails |=), the proof theory is said to be 'sound'. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.1.7) |
| 9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
| Full Idea: If every semantically valid inference is proof-theoretically valid (so that |= entails |-), the proof-theory is said to be 'complete'. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.1.7) |
| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| Full Idea: If a wff is tautologically implied by a set of wff's, it is implied by a finite subset of them; and if every finite subset is satisfiable, then so is the whole set of wff's. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 2.5) | |
| A reaction: [Enderton's account is more symbolic] He adds that this also applies to models. It is a 'theorem' because it can be proved. It is a major theorem in logic, because it brings the infinite under control, and who doesn't want that? |
| 9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
| Full Idea: A set of expressions is 'decidable' iff there exists an effective procedure (qv) that, given some expression, will decide whether or not the expression is included in the set (i.e. doesn't contradict it). | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.7) | |
| A reaction: This is obviously a highly desirable feature for a really reliable system of expressions to possess. All finite sets are decidable, but some infinite sets are not. |
| 9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
| Full Idea: The Enumerability Theorem says that for a reasonable language, the set of valid wff's can be effectively enumerated. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 2.5) | |
| A reaction: There are criteria for what makes a 'reasonable' language (probably specified to ensure enumerability!). Predicates and functions must be decidable, and the language must be finite. |
| 14193 | 'Substance theorists' take modal properties as primitive, without structure, just falling under a sortal [Paul,LA] |
| Full Idea: Some deep essentialists resist the need to explain the structure under de re modal properties, taking them as primitive. One version (which we can call 'substance theory') takes them to fall under a sortal concept, with no further explanation. | |
| From: L.A. Paul (In Defense of Essentialism [2006], §1) | |
| A reaction: A very helpful identification of what Wiggins stands for, and why I disagree with him. The whole point of essences is to provide a notion that fits in with sciences, which means they must have an explanatory role, which needs structures. |
| 14195 | If an object's sort determines its properties, we need to ask what determines its sort [Paul,LA] |
| Full Idea: If the substance essentialist holds that the sort an object belongs to determines its de re modal properties (rather than the other way round), then he needs to give an (ontological, not conceptual) explanation of what determines an object's sort. | |
| From: L.A. Paul (In Defense of Essentialism [2006], §1) | |
| A reaction: See Idea 14193 for 'substance essentialism'. I find it quite incredible that anyone could think that a thing's sort could determine its properties, rather than the other way round. Even if sortals are conventional, they are not arbitrary. |
| 14196 | Substance essentialism says an object is multiple, as falling under various different sortals [Paul,LA] |
| Full Idea: The explanation of material constitution given by substance essentialism is that there are multiple objects. A person is essentially human-shaped (falling under the human sort), while their hunk of tissue is accidentally human-shaped (as tissue). | |
| From: L.A. Paul (In Defense of Essentialism [2006], §1) | |
| A reaction: At this point sortal essentialism begins to look crazy. Persons are dubious examples (with sneaky dualism involved). A bronze statue is essentially harder to dent than a clay one, because of its bronze. If you remake it of clay, it isn't the same statue. |
| 14198 | Absolutely unrestricted qualitative composition would allow things with incompatible properties [Paul,LA] |
| Full Idea: Absolutely unrestricted qualitative composition would imply that objects with incompatible properties and objects such as winged pigs or golden mountains were actual. | |
| From: L.A. Paul (In Defense of Essentialism [2006], §5) | |
| A reaction: Note that this is 'qualitative' composition, and not composition of parts. The objection seems to rule out unrestricted qualitative composition, since you could hardly combine squareness with roundness. |
| 14190 | Deep essentialist objects have intrinsic properties that fix their nature; the shallow version makes it contextual [Paul,LA] |
| Full Idea: Essentialism says that objects have their properties essentially. 'Deep' essentialists take the (nontrivial) essential properties of an object to determine its nature. 'Shallow' essentialists substitute context-dependent truths for the independent ones. | |
| From: L.A. Paul (In Defense of Essentialism [2006], Intro) | |
| A reaction: If the deep essence determines a things nature, we should not need to say 'nontrivial'. This is my bete noire, the confusion of essential properties with necessary ones, where necessary properties (or predicates, at least) can indeed be trivial. |
| 14191 | Deep essentialists say essences constrain how things could change; modal profiles fix natures [Paul,LA] |
| Full Idea: The deep essentialist holds that most objects have essential properties such that there are many ways they could not be, or many changes through which they could not persist. Objects' modal profiles characterize their natures. | |
| From: L.A. Paul (In Defense of Essentialism [2006], Intro) | |
| A reaction: This is the view I like, especially the last bit. If your modal profile doesn't determine your nature, then what does? Think of how you sum up a person at a funeral. Your modal profile is determined by dispositions and powers. |
| 14192 | Essentialism must deal with charges of arbitrariness, and failure to reduce de re modality [Paul,LA] |
| Full Idea: Two objections to deep essentialism are that it falters when faced with a skeptical objection concerning arbitrariness, and the need for a reductive account of de re modality. | |
| From: L.A. Paul (In Defense of Essentialism [2006], Intro) | |
| A reaction: An immediate response to the second objection might be to say that modal facts about things are not reducible. The charge of arbitrariness (i.e. total arbitrariness, not just a bit of uncertainty) is the main thing a theory of essences must deal with. |
| 14197 | An object's modal properties don't determine its possibilities [Paul,LA] |
| Full Idea: I reject the view that an object's de re modal properties determine its relations to possibilia. | |
| From: L.A. Paul (In Defense of Essentialism [2006], §3) | |
| A reaction: You'll have to read Paul to see why, but I flat disagree with her on this. The whole point of accepting such properties is to determine the modal profile of the thing, and hence see how it can fit into and behave in the world. |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| Full Idea: Not all sentences using 'if' are conditionals. Consider 'if you want a banana, there is one in the kitchen'. The rough test is that a conditional can be rewritten as 'that A implies that B'. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.6.4) |
| 14189 | 'Modal realists' believe in many concrete worlds, 'actualists' in just this world, 'ersatzists' in abstract other worlds [Paul,LA] |
| Full Idea: A 'modal realist' believes that there are many concrete worlds, while the 'actualist' believes in only one concrete world, the actual world. The 'ersatzist' is an actualist who takes nonactual possible worlds and their contents to be abstracta. | |
| From: L.A. Paul (In Defense of Essentialism [2006], Intro) | |
| A reaction: My view is something like that modal realism is wrong, and actualism is right, and possible worlds (if they really are that useful) are convenient abstract fictions, constructed (if we have any sense) out of the real possibilities in the actual world. |
| 16861 | A false theory could hardly rival the explanatory power of natural selection [Darwin] |
| Full Idea: It can hardly be supposed that a false theory would explain, in so satisfactory a manner as does the theory of natural selection, the several large classes of facts above specified. | |
| From: Charles Darwin (The Origin of the Species [1859], p.476), quoted by Peter Lipton - Inference to the Best Explanation (2nd) 11 'The scientific' | |
| A reaction: More needs to be said, since the whims of God could explain absolutely everything (in a manner that would be somehow less that fully satisfying to the enquiring intellect). |