55 ideas
| 7990 | Serene wisdom is freedom from ties, and indifference to fortune [Anon (Bhag)] |
| Full Idea: Who everywhere is free from all ties, who neither rejoices nor sorrows if fortune is good or is ill, his is a serene wisdom. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 2.57) | |
| A reaction: This is very similar to the 'apatheia' of the Stoics, though they are always more committed to rationality. This is quite a good strategy when times are hard, but as a general rule it offers a bogus state of 'wisdom' which is really half way to death. |
| 7989 | Seek salvation in the wisdom of reason [Anon (Bhag)] |
| Full Idea: Seek salvation in the wisdom of reason. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 2.49) | |
| A reaction: Quotations like this can usually be counterbalanced in eastern philosophy by wild irrationality, but they certainly felt to tug of reason. Only the Dhaoists seem really opposed to reason (e.g. Idea 7289). |
| 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) |
| 13831 | Logic is based on transitions between sentences [Prawitz] |
| Full Idea: I agree entirely with Dummett that the right way to answer the question 'what is logic?' is to consider transitions between sentences. | |
| From: Dag Prawitz (Gentzen's Analysis of First-Order Proofs [1974], §04) | |
| A reaction: I always protest at this point that reliance on sentences is speciesism against animals, who are thereby debarred from reasoning. See the wonderful Idea 1875 of Chrysippus. Hacking's basic suggestion seems right. Transition between thoughts. |
| 13827 | Logical consequence isn't a black box (Tarski's approach); we should explain how arguments work [Prawitz] |
| Full Idea: Defining logical consequence in the way Tarski does is a rather meagre result, treating an argument as a black box, observing input and output, while disregarding inner structure. We should define logical consequence on the basis of valid arguments. | |
| From: Dag Prawitz (On the General Idea of Proof Theory [1974], §2) |
| 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. |
| 13825 | Natural deduction introduction rules may represent 'definitions' of logical connectives [Prawitz] |
| Full Idea: With Gentzen's natural deduction, we may say that the introductions represent, as it were, the 'definitions' of the logical constants. The introductions are not literally understood as 'definitions'. | |
| From: Dag Prawitz (Gentzen's Analysis of First-Order Proofs [1974], 2.2.2) | |
| A reaction: [Hacking, in 'What is Logic? §9' says Gentzen had the idea that his rules actually define the constants; not sure if Prawitz and Hacking are disagreeing] |
| 13823 | In natural deduction, inferences are atomic steps involving just one logical constant [Prawitz] |
| Full Idea: In Gentzen's natural deduction, the inferences are broken down into atomic steps in such a way that each step involves only one logical constant. The steps are the introduction or elimination of the logical constants. | |
| From: Dag Prawitz (Gentzen's Analysis of First-Order Proofs [1974], 1.1) |
| 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. |
| 13826 | Model theory looks at valid sentences and consequence, but not how we know these things [Prawitz] |
| Full Idea: In model theory, which has dominated the last decades, one concentrates on logically valid sentences, and what follows logically from what, but one disregards questions concerning how we know these things. | |
| From: Dag Prawitz (On the General Idea of Proof Theory [1974], §1) |
| 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. |
| 7996 | I am all the beauty and goodness of things, says Krishna [Anon (Bhag)] |
| Full Idea: I am the beauty of all things beautiful; ...I am the goodness of those who are good, says Krishna. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 10.36) | |
| A reaction: Another attempt to annexe everything which is admirable to the nature of God. This sounds strikingly Platonic (c.f. Idea 7992, which seems Aristotelian). One scholar dates the text to 150 BCE. I think there is influence, one way or the other. |
| 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) |
| 7995 | In all living beings I am the light of consciousness, says Krishna [Anon (Bhag)] |
| Full Idea: In all living beings I am the light of consciousness, says Krishna. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 10.22) | |
| A reaction: Everything grand seems to be claimed for God at this stage of culture, but I am not sure how coherent this view is, unless this is pantheism. In what sense could we possibly be Krishna, when none of us (except Arjuna) is aware of it? |
| 7999 | All actions come from: body, lower self, perception, means of action, or Fate [Anon (Bhag)] |
| Full Idea: Whatever a man does, good or bad, in thought, word or deed, has these five sources of action: the body, the lower 'I am', the means of perception, the means of action, and Fate. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 18.14/15) | |
| A reaction: The 'means of action' will presumably take care of anything we haven't thought of! Nothing quite matches the idea of 'the will' here. A twitch from the first, eating from the second, a startled jump from the third, struck by lightning from the fifth. |
| 7991 | Hate and lust have their roots in man's lower nature [Anon (Bhag)] |
| Full Idea: Hate and lust for things of nature have their roots in man's lower nature. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 3.34) | |
| A reaction: It seems outmoded now (since Freud) to label parts of human nature as 'higher' and 'lower'. I would defend the distinction, but it is not self-evident. The basis of morality is good citizenship, and parts of our nature are detrimental to that. |
| 7988 | There is no greater good for a warrior than to fight in a just war [Anon (Bhag)] |
| Full Idea: There is no greater good for a warrior than to fight in righteous war. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 2.31) | |
| A reaction: What worries me now is not the urging to fight, as long as a good cause can be found, but the idea that someone should see his social role as 'warrior'. The modern 'soldier' is ready to fight, but a traditional 'warrior' is obliged to fight. |
| 7992 | The visible forms of nature are earth, water, fire, air, ether; mind, reason, and the sense of 'I' [Anon (Bhag)] |
| Full Idea: The visible forms of nature are eight: earth, water, fire, air, ether; the mind, reason, and the sense of 'I'. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 7.4) | |
| A reaction: Presumably there is an implication that there are also invisible forms. The Bhuddists launched an attack on 'I' as one of the categories. The first five appear to be Aristotle's, which must be of scholarly (and chronological) interest. |
| 7994 | Everything, including the gods, comes from me, says Krishna [Anon (Bhag)] |
| Full Idea: All the gods come from me, says Krishna. ...I am the one source of all | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 10.2/8) | |
| A reaction: This seems very close to monotheism, and sounds very similar to the position that Zeus seems to occupy in later Greek religion, where he is shading off into a supreme and spiritual entity. |
| 7993 | Brahman is supreme, Atman his spirit in man, and Karma is the force of creation [Anon (Bhag)] |
| Full Idea: Brahman is supreme, the Eternal. Atman is his Spirit in man. Karma is the force of creation, wherefrom all things have their life. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 8.3) | |
| A reaction: I can't help wondering how they know all this stuff, but then I'm just a typical product of my culture. We seem to have a trinity here. Who's in charge? Is Atman just a servant? Is Karma totally under the control of Brahman? |
| 7997 | Only by love can men see me, know me, and come to me, says Krishna [Anon (Bhag)] |
| Full Idea: Only by love can men see me, and know me, and come unto me, says Krishna | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 11.54) | |
| A reaction: There seems to be a paradox here, as it is unclear how you can love Krishna, if you have not already seen him in some way. This is another paradox of fideism - that faith cannot possibly be the first step in a religion, as faith needs a target. |
| 7998 | The three gates of hell are lust, anger and greed [Anon (Bhag)] |
| Full Idea: Three are the gates of this hell, the death of the soul: the gate of lust, the gate of wrath, and the gate of greed. Let a man shun the three. | |
| From: Anon (Bhag) (The Bhagavad Gita [c.500 BCE], 16.21) | |
| A reaction: Anyone who wishes to procreate, champion justice, and make a living, has to pursue all three. Wisdom consists of pursuing the three appropriately, not in shunning them. How did this bizarre puritanism ever come to grip the human race? |