42 ideas
| 14519 | It is a great good to show reverence for a wise man [Epicurus] |
| Full Idea: To show reverence for a wise man is itself a great good for him who reveres [the wise man]. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 32) | |
| A reaction: It is characteristic of Epicurus to move up a level in his thinking, and not merely respect wisdom, but ask after the value of his own respect. Compare Idea 14517. Nice. |
| 14518 | In the study of philosophy, pleasure and knowledge arrive simultaneously [Epicurus] |
| Full Idea: In philosophy the pleasure accompanies the knowledge. For the enjoyment does not come after the learning but the learning and the enjoyment are simultaneous. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 27) |
| 23367 | Even pointing a finger should only be done for a reason [Epictetus] |
| Full Idea: Philosophy says it is not right even to stretch out a finger without some reason. | |
| From: Epictetus (fragments/reports [c.57], 15) | |
| A reaction: The key point here is that philosophy concerns action, an idea on which Epictetus is very keen. He rather despise theory. This idea perfectly sums up the concept of the wholly rational life (which no rational person would actually want to live!). |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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. |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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. |
| 14524 | Bodies are combinations of shape, size, resistance and weight [Epicurus] |
| Full Idea: Epicurus said that body was conceived as an aggregate of shape and size and resistance and weight. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE]) | |
| A reaction: [Source Sextus 'Adversus Mathematicos' 10.257] Note that this is how we 'conceive' them. They might be intrinsically different, except that Epicurus is pretty much a phenomenalist. |
| 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) |
| 14521 | If everything is by necessity, then even denials of necessity are by necessity [Epicurus] |
| Full Idea: He who claims that everything occurs by necessity has no complaint against him who claims that everything does not occur by necessity. For he makes the very claim in question by necessity. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 40) |
| 14522 | What happens to me if I obtain all my desires, and what if I fail? [Epicurus] |
| Full Idea: One should bring this question to bear on all one's desires: what will happen to me if what is sought by desire is achieved, and what will happen if it is not? | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 71) | |
| A reaction: Yet another example of Epicurus moving up a level in his thinking about ethical issues, as in Idea 14517 and Idea 14519. The mark of a true philosopher. This seems to be a key idea for wisdom - to think further ahead than merely what you desire. |
| 3563 | Pleasure and virtue entail one another [Epicurus] |
| Full Idea: It is not possible to live pleasantly without living intelligently and finely and justly, nor to live intelligently and finely and justly without living pleasantly. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 5), quoted by Julia Annas - The Morality of Happiness Ch.16 | |
| A reaction: A person with all these virtues might still suffer from depression. And I don't see why having limited intelligence should stop someone from living pleasantly. Just be warm-hearted. |
| 3560 | Justice is merely a contract about not harming or being harmed [Epicurus] |
| Full Idea: There is no such things as justice in itself; in people's relations with one another in any place and at any time it is a contract about not harming or being harmed. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 33), quoted by Julia Annas - The Morality of Happiness 13.2 |
| 14517 | We value our own character, whatever it is, and we should respect the characters of others [Epicurus] |
| Full Idea: We value our characters as our own personal possessions, whether they are good and envied by men or not. We must regard our neighbours' characters thus too, if they are respectable. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 15) | |
| A reaction: I like this because it introduces a metaethical dimension to the whole problem of virtue. We should value our own character - so should we try to improve it? Should we improve so much as to become unrecognisable? |
| 14513 | Justice is a pledge of mutual protection [Epicurus] |
| Full Idea: The justice of nature is a pledge of reciprocal usefulness, neither to harm one another nor to be harmed. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 31) | |
| A reaction: Notice that justice is not just reciprocal usefulness, but a 'pledge' to that effect. This implies a metaethical value of trust and honesty in keeping the pledge. Is it better to live by the pledge, or to be always spontaneously useful? |
| 14515 | A law is not just if it is not useful in mutual associations [Epicurus] |
| Full Idea: If someone passes a law and it does not turn out to be in accord with what is useful in mutual associations, this no longer possesses the nature of justice. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 37) |
| 14520 | It is small-minded to find many good reasons for suicide [Epicurus] |
| Full Idea: He is utterly small-minded for whom there are many plausible reasons for committing suicide. | |
| From: Epicurus (Principle Doctrines ('Kuriai Doxai') (frags) [c.290 BCE], 38) | |
| A reaction: It is a pity that the insult of 'small-minded' has slipped out of philosophy. The Greeks use it all the time, and know exactly what it means. We all recognise small-mindedness, and it is a great (and subtle) vice. |