57 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) |
| 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. |
| 1553 | No perceptible object is truly straight or curved [Protagoras] |
| Full Idea: No perceptible object is geometrically straight or curved; after all, a circle does not touch a ruler at a point, as Protagoras used to say, in arguing against the geometers. | |
| From: Protagoras (fragments/reports [c.441 BCE], B07), quoted by Aristotle - Metaphysics 998a1 |
| 18085 | Values that approach zero, becoming less than any quantity, are 'infinitesimals' [Cauchy] |
| Full Idea: When the successive absolute values of a variable decrease indefinitely in such a way as to become less than any given quantity, that variable becomes what is called an 'infinitesimal'. Such a variable has zero as its limit. | |
| From: Augustin-Louis Cauchy (Cours d'Analyse [1821], p.19), quoted by Philip Kitcher - The Nature of Mathematical Knowledge 10.4 | |
| A reaction: The creator of the important idea of the limit still talked in terms of infinitesimals. In the next generation the limit took over completely. |
| 18084 | When successive variable values approach a fixed value, that is its 'limit' [Cauchy] |
| Full Idea: When the values successively attributed to the same variable approach indefinitely a fixed value, eventually differing from it by as little as one could wish, that fixed value is called the 'limit' of all the others. | |
| From: Augustin-Louis Cauchy (Cours d'Analyse [1821], p.19), quoted by Philip Kitcher - The Nature of Mathematical Knowledge 10.4 | |
| A reaction: This seems to be a highly significan proposal, because you can now treat that limit as a number, and adds things to it. It opens the door to Cantor's infinities. Is the 'limit' just a fiction? |
| 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) |
| 1549 | Everything that exists consists in being perceived [Protagoras] |
| Full Idea: Everything that exists consists in being perceived. | |
| From: Protagoras (fragments/reports [c.441 BCE]), quoted by Didymus the Blind - Commentary on the Psalms (frags) | |
| A reaction: A striking anticipation of Berkeley's "esse est percipi" (to be is to be perceived). |
| 1545 | Protagoras was the first to claim that there are two contradictory arguments about everything [Protagoras, by Diog. Laertius] |
| Full Idea: Protagoras was the first to claim that there are two contradictory arguments about everything. | |
| From: report of Protagoras (fragments/reports [c.441 BCE], A01) by Diogenes Laertius - Lives of Eminent Philosophers 09.51 |
| 1547 | Man is the measure of all things - of things that are, and of things that are not [Protagoras] |
| Full Idea: He began one of his books as follows: 'Man is the measure of all things - of the things that are, that they are, and of the things that are not, that they are not'. | |
| From: Protagoras (fragments/reports [c.441 BCE], B01), quoted by Diogenes Laertius - Lives of Eminent Philosophers 09.51 |
| 3305 | There is no more purely metaphysical doctrine than Protagorean relativism [Benardete,JA on Protagoras] |
| Full Idea: No purer metaphysical doctrine can possibly be found than the Protagorean thesis that to be (anything at all) is to be relative ( to something or other). | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by José A. Benardete - Metaphysics: the logical approach Ch.3 |
| 3313 | If my hot wind is your cold wind, then wind is neither hot nor cold, and so not as cold as itself [Benardete,JA on Protagoras] |
| Full Idea: Because the wind is cold to me but not you, Protagoras takes it to in itself neither cold nor not-cold. Accordingly, I very much doubt that he can allow the wind to be exactly as cold as itself. | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by José A. Benardete - Metaphysics: the logical approach Ch.8 |
| 3317 | You can only state the problem of the relative warmth of an object by agreeing on the underlying object [Benardete,JA on Protagoras] |
| Full Idea: Only if the thing that is cold to me is precisely identical with the thing that is not cold to you can Protagoras launch his argument, but then it is seen to be the thing in itself that exists absolutely speaking. | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by José A. Benardete - Metaphysics: the logical approach Ch.8 |
| 247 | God is "the measure of all things", more than any man [Plato on Protagoras] |
| Full Idea: In our view it is God who is pre-eminently the "measure of all things", much more so than any "man", as they say. | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by Plato - The Laws 716c |
| 606 | Protagoras absurdly thought that the knowing or perceiving man is 'the measure of all things' [Aristotle on Protagoras] |
| Full Idea: When Protagoras quipped that man is the measure of all things, he had in mind, of course, the knowing or perceiving man. The grounds are that they have perception/knowledge, and these are said to be the measures of objects. Utter nonsense! | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by Aristotle - Metaphysics 1053b |
| 612 | Relativists think if you poke your eye and see double, there must be two things [Aristotle on Protagoras] |
| Full Idea: In fact there is no difference between Protagoreanism and saying this: if you stick your finger under your eyes and make single things seem two, then they are two, just because they seem to be two. | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by Aristotle - Metaphysics 1063a06 |
| 6016 | Early sophists thought convention improved nature; later they said nature was diminished by it [Protagoras, by Miller,FD] |
| Full Idea: Protagoras and Hippias evidently believed that convention was an improvement on nature, whereas later sophists such as Antiphon, Thrasymachus and Callicles seemed to contend that conventional morality was undermined because it was 'against nature'. | |
| From: report of Protagoras (fragments/reports [c.441 BCE]) by Fred D. Miller jr - Classical Political Thought | |
| A reaction: This gets to the heart of a much more interesting aspect of the nomos-physis (convention-nature) debate, rather than just a slanging match between relativists and the rest. The debate still goes on, over issues about the free market and intervention. |
| 1580 | For Protagoras the only bad behaviour is that which interferes with social harmony [Protagoras, by Roochnik] |
| Full Idea: For Protagoras the only constraint on human behaviour is that it not interfere with social harmony, the essential condition for human survival. | |
| From: report of Protagoras (fragments/reports [c.441 BCE]) by David Roochnik - The Tragedy of Reason p.63 |
| 205 | Protagoras contradicts himself by saying virtue is teachable, but then that it is not knowledge [Plato on Protagoras] |
| Full Idea: Protagoras claimed that virtue was teachable, but now tries to show it is not knowledge, which makes it less likely to be teachable. | |
| From: comment on Protagoras (fragments/reports [c.441 BCE]) by Plato - Protagoras 361b |
| 1659 | Protagoras seems to have made the huge move of separating punishment from revenge [Protagoras, by Vlastos] |
| Full Idea: The distinction of punishment from revenge must be regarded as one of the most momentous of the conceptual discoveries ever made by humanity in the course of its slow, tortuous, precarious, emergence from barbaric tribalism. Protagoras originated it. | |
| From: report of Protagoras (fragments/reports [c.441 BCE]) by Gregory Vlastos - Socrates: Ironist and Moral Philosopher p.187 |
| 532 | Successful education must go deep into the soul [Protagoras] |
| Full Idea: Education does not take root in the soul unless one goes deep. | |
| From: Protagoras (fragments/reports [c.441 BCE], B11), quoted by Plutarch - On Practice 178.25 |
| 1552 | He spent public money on education, as it benefits the individual and the state [Protagoras, by Diodorus of Sicily] |
| Full Idea: He used legislation to improve the condition of illiterate people, on the grounds that they lack one of life's great goods, and thought literacy should be a matter of public concern and expense. | |
| From: report of Protagoras (fragments/reports [c.441 BCE]) by Diodorus of Sicily - Universal History 12.13.3.3 |
| 1551 | He said he didn't know whether there are gods - but this is the same as atheism [Diogenes of Oen. on Protagoras] |
| Full Idea: He said that he did not know whether there were gods - but this is the same as saying that he knew there were no gods. | |
| From: comment on Protagoras (fragments/reports [c.441 BCE], A23) by Diogenes (Oen) - Wall inscription 11 Chil 2 |