61 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) |
| 13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
| Full Idea: To know if A ∈ B, we look at the set A as a single object, and check if it is among B's members. But if we want to know whether A ⊆ B then we must open up set A and check whether its various members are among the members of B. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 1:04) | |
| A reaction: This idea is one of the key ideas to grasp if you are going to get the hang of set theory. John ∈ USA ∈ UN, but John is not a member of the UN, because he isn't a country. See Idea 12337 for a special case. |
| 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) |
| 13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton] |
| Full Idea: The 'ordered pair' <x,y> is defined to be {{x}, {x,y}}; hence it can be proved that <u,v> = <x,y> iff u = x and v = y (given by Kuratowski in 1921). ...The definition is somewhat arbitrary, and others could be used. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 3:36) | |
| A reaction: This looks to me like one of those regular cases where the formal definitions capture all the logical behaviour of the concept that are required for inference, while failing to fully capture the concept for ordinary conversation. |
| 13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
| Full Idea: A 'linear ordering' (or 'total ordering') on A is a binary relation R meeting two conditions: R is transitive (of xRy and yRz, the xRz), and R satisfies trichotomy (either xRy or x=y or yRx). | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 3:62) |
| 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) |
| 13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
| Full Idea: Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ. A man with an empty container is better off than a man with nothing. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 1.03) |
| 13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
| Full Idea: It might be thought at first that the empty set would be a rather useless or even frivolous set to mention, but from the empty set by various set-theoretic operations a surprising array of sets will be constructed. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 1:02) | |
| A reaction: This nicely sums up the ontological commitments of mathematics - that we will accept absolutely anything, as long as we can have some fun with it. Sets are an abstraction from reality, and the empty set is the very idea of that abstraction. |
| 13203 | The singleton is defined using the pairing axiom (as {x,x}) [Enderton] |
| Full Idea: Given any x we have the singleton {x}, which is defined by the pairing axiom to be {x,x}. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 2:19) | |
| A reaction: An interesting contrivance which is obviously aimed at keeping the axioms to a minimum. If you can do it intuitively with a new axiom, or unintuitively with an existing axiom - prefer the latter! |
| 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) |
| 13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
| Full Idea: It was observed by several people that for a satisfactory theory of ordinal numbers, Zermelo's axioms required strengthening. The Axiom of Replacement was proposed by Fraenkel and others, giving rise to the Zermelo-Fraenkel (ZF) axioms. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 1:15) |
| 13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
| Full Idea: For functions, we know that for any y there exists an appropriate x, but we can't yet form a function H, as we have no way of defining one particular choice of x. Hence we need the axiom of choice. | |
| From: Herbert B. Enderton (Elements of Set Theory [1977], 3:48) |
| 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) |
| 10794 | The nominalist is tied by standard semantics to first-order, denying higher-order abstracta [Marcus (Barcan)] |
| Full Idea: The nominalist finds that standard semantics shackles him to first-order languages if, as nominalists are wont, he is to make do without abstract higher order objects. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.166) | |
| A reaction: Aha! Since I am pursuing a generally nominalist strategy in metaphysics, I suddenly see that I must adopt a hostile attitude to higher-order logic! Maybe plural quantification is the way to go, with just first-order objects. |
| 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. |
| 10786 | Anything which refers tends to be called a 'name', even if it isn't a noun [Marcus (Barcan)] |
| Full Idea: The tendency has been to call any expression a 'name', however distant from the grammatical category of nouns, provided it is seen as referring. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.162) |
| 10788 | Nominalists see proper names as a main vehicle of reference [Marcus (Barcan)] |
| Full Idea: For a nominalist with an ontology of empirically distinguishable objects, proper names are seen as a primary vehicle of reference. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.162) |
| 10799 | Nominalists should quantify existentially at first-order, and substitutionally when higher [Marcus (Barcan)] |
| Full Idea: For the nominalist, at level zero, where substituends are referring names, the quantifiers may be read existentially. Beyond level zero, the variables and quantifiers are read sustitutionally (though it is unclear whether this program is feasible). | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.167) |
| 10790 | Quantifiers are needed to refer to infinitely many objects [Marcus (Barcan)] |
| Full Idea: An adequate language for referring to infinitely many objects would seem to require variables and quantifiers in addition to names. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.164) |
| 10791 | Substitutional semantics has no domain of objects, but place-markers for substitutions [Marcus (Barcan)] |
| Full Idea: On a substitutional semantics of a first-order language, a domain of objects is not specified. Variables do not range over objects. They are place markers for substituends (..and sentences are true-for-all-names, or true-for-at-least-one-name). | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.165) |
| 10785 | Maybe a substitutional semantics for quantification lends itself to nominalism [Marcus (Barcan)] |
| Full Idea: It has been suggested that a substitutional semantics for quantification theory lends itself to nominalistic aims. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.161) |
| 10795 | Substitutional language has no ontology, and is just a way of speaking [Marcus (Barcan)] |
| Full Idea: Translation into a substitutional language does not force the ontology. It remains, literally, and until the case for reference can be made, a façon de parler. That is the way the nominalist would like to keep it. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.166) |
| 10798 | A true universal sentence might be substitutionally refuted, by an unnamed denumerable object [Marcus (Barcan)] |
| Full Idea: Critics say if there are nondenumerably many objects, then on the substitutional view there might be true universal sentences falsified by an unnamed object, and there must always be some such, for names are denumerable. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.167) | |
| A reaction: [See Quine 'Reply to Prof. Marcus' p.183] The problem seems to be that there would be names which are theoretically denumerable, but not nameable, and hence not available for substitution. Marcus rejects this, citing compactness. |
| 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. |
| 10787 | Is being just referent of the verb 'to be'? [Marcus (Barcan)] |
| Full Idea: Being itself has been viewed as referent of the verb 'to be'. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.162) |
| 10789 | Nominalists say predication is relations between individuals, or deny that it refers [Marcus (Barcan)] |
| Full Idea: Nominalists have the major task of explaining how predicates work. They usually construct it as a relation between individuals, or deny the referential function of predicates. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.163) |
| 10796 | If objects are thoughts, aren't we back to psychologism? [Marcus (Barcan)] |
| Full Idea: If objects are thoughts, aren't we back to psychologism? | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.166) | |
| A reaction: Personally I don't think that would be the end of the world, but Fregeans go into paroxyms at the mention of 'psychology', because they fear that it destroys objectivity. That may be because they haven't understood thought properly. |
| 11181 | Aristotelian essentialism involves a 'natural' or 'causal' interpretation of modal operators [Marcus (Barcan)] |
| Full Idea: Aristotelian essentialism may best be understood on a 'natural' or 'causal' interpretation of the modal operators. | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.189) | |
| A reaction: I record this because I very much like the sound of it, though I have yet to fully understand it. |
| 11184 | Aristotelian essentialism is about shared properties, individuating essentialism about distinctive properties [Marcus (Barcan)] |
| Full Idea: An object must have some of its natural properties in this world. Some of those it has in common with objects of some proximate kind (Aristotelian essentialism), and others individuate it from objects of the same kind (individuating essentialism). | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.193) |
| 11180 | Essentialist sentences are not theorems of modal logic, and can even be false [Marcus (Barcan)] |
| Full Idea: In the range of modal systems for which Saul Kripke has provided a semantics, no essentialist sentence is a theorem. Furthermore, there are models for which such sentences are demonstrably false. | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.188) |
| 11186 | 'Essentially' won't replace 'necessarily' for vacuous properties like snub-nosed or self-identical [Marcus (Barcan)] |
| Full Idea: We would never use 'is essentially' for 'is necessarily' where vacuous properties are concerned, as in 'Socrates is essentially snub-nosed' or 'Socrates is essentially Socrates'. | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.193) | |
| A reaction: This simple point does us a huge service in rescuing the word 'essential' from several hundred years of misguided philosophy. |
| 11185 | 'Is essentially' has a different meaning from 'is necessarily', as they often cannot be substituted [Marcus (Barcan)] |
| Full Idea: There seems to be surface synonymy between 'is essentially' and de re occurrences of 'is necessarily', but intersubstitution often fails to preserve sense (as in 'Winston is essentially a cyclist' and 'Winston is necessarily a cyclist'). | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.193) | |
| A reaction: Clearly the two sentences have different meanings, with 'essentially' being a comment about the nature of Winston, and 'necessarily' probably being a comment about the circumstances in which he finds himself. Very nice. See also Idea 11186. |
| 11182 | If essences are objects with only essential properties, they are elusive in possible worlds [Marcus (Barcan)] |
| Full Idea: Some philosophers make a metaphysical shift, by inventing objects (individual concepts, forms, substances) called 'essences', which have only essential properties, and then worry when they can't locate them by rummaging around in possible worlds. | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.192) |
| 10797 | Substitutivity won't fix identity, because expressions may be substitutable, but not refer at all [Marcus (Barcan)] |
| Full Idea: Substitutivity 'salve veritate' cannot define identity since two expressions may be everywhere intersubstitutable and not refer at all. | |
| From: Ruth Barcan Marcus (Nominalism and Substitutional Quantifiers [1978], p.167) |
| 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) |
| 11183 | The use of possible worlds is to sort properties (not to individuate objects) [Marcus (Barcan)] |
| Full Idea: The usefulness of talk about possible worlds is not for purposes of individuating the object - that can be done in this world; such talk is a way of sorting its properties. | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.192) | |
| A reaction: 'Possible worlds are a device for sorting properties' sounds to me like a promising slogan. Ruth Marcus originated rigid designation, before Kripke came up with the label. |
| 11187 | In possible worlds, names are just neutral unvarying pegs for truths and predicates [Marcus (Barcan)] |
| Full Idea: The strategem of talk about possible worlds is that truth assignments of sentences and extensions of predicates may vary, but individual names don't alter their reference (unless they don't refer). They are a neutral peg for descriptions. | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.194) |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |
| Full Idea: Anaxarchus said that he was not even sure that he knew nothing. | |
| From: report of Anaxarchus (fragments/reports [c.340 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 09.10.1 |
| 11189 | Dispositional essences are special, as if an object loses them they cease to exist [Marcus (Barcan)] |
| Full Idea: Being gold or being a man is not accidental. ..Such essences are dispositional properties of a very special kind: if an object had such a property and ceased to have it, it would have ceased to exist or have changed (as if gold is transmuted to lead). | |
| From: Ruth Barcan Marcus (Essential Attribution [1971], p.202) | |
| A reaction: Ruth Marcus is an important founder of modern scientific essentialism, by not only proposing the notion we call rigid designation, but by explicitly defending the essential identities that seem to emerge from modal logic. |