42 ideas
| 5896 | Speak the truth, for this alone deifies man [Pythagoras, by Porphyry] |
| Full Idea: Pythagoras advised above all things to speak the truth, for this alone deifies man. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Porphyry - Life of Pythagoras §41 | |
| A reaction: Idea 4421 (of Nietzsche) stands in contrast to this. I am not quite sure why speaking the truth has such a high value. I am inclined to a minimalist view, which is just that philosophy is an attempt to speak the truth, as fishermen try to catch fish. |
| 3051 | Pythagoras discovered the numerical relation of sounds on a string [Pythagoras, by Diog. Laertius] |
| Full Idea: Pythagoras discovered the numerical relation of sounds on a string. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 08.1.11 |
| 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. |
| 7485 | For Pythagoreans 'one' is not a number, but the foundation of numbers [Pythagoras, by Watson] |
| Full Idea: For Pythagoreans, one, 1, is not a true number but the 'essence' of number, out of which the number system emerges. | |
| From: report of Pythagoras (reports [c.530 BCE], Ch.8) by Peter Watson - Ideas Ch.8 | |
| A reaction: I think this is right! Counting and numbers only arise once the concept of individuality and identity have arisen. Counting to one is no more than observing the law of identity. 'Two' is the big adventure. |
| 21598 | Austin revealed many meanings for 'vague': rough, ambiguous, general, incomplete... [Austin,JL, by Williamson] |
| Full Idea: Austin's account brought out the variety of features covered by 'vague' in different contexts: roughness, ambiguity, imprecision, lack of detail, generality, inaccuracy, incompleteness. Even 'vague' is vague. | |
| From: report of J.L. Austin (Sense and Sensibilia [1962], p.125-8) by Timothy Williamson - Vagueness 3.1 | |
| A reaction: Some of these sound the same. Maybe Austin distinguishes them. |
| 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) |
| 3053 | Pythagoras taught that virtue is harmony, and health, and universal good, and God [Pythagoras, by Diog. Laertius] |
| Full Idea: Pythagoras taught that virtue is harmony, and health, and universal good, and God. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 08.1.19 | |
| A reaction: I like the link with health, because I consider that a bridge over the supposed fact-value gap. Very Pythagorean to think that virtue is harmony. Plato liked that thought. |
| 5244 | For Pythagoreans, justice is simply treating all people the same [Pythagoras, by Aristotle] |
| Full Idea: Some even think that what is just is simple reciprocity, as the Pythagoreans maintained, because they defined justice simply as having done to one what one has done to another. | |
| From: report of Pythagoras (reports [c.530 BCE], 28) by Aristotle - Nicomachean Ethics 1132b22 | |
| A reaction: One wonders what Pythagoreans made of slavery. Aristotle argues that officials, for example, have superior rights. The Pythagorean idea makes fairness the central aspect of justice, and that must at least be partly right. |
| 375 | When musical harmony and rhythm were discovered, similar features were seen in bodily movement [Pythagoras, by Plato] |
| Full Idea: When our predecessors discovered musical scales, they also discovered similar features in bodily movement, which should also be measured numerically, and called 'tempos' and 'measures'. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Plato - Philebus 17d |
| 638 | Pythagoreans define timeliness, justice and marriage in terms of numbers [Pythagoras, by Aristotle] |
| Full Idea: The Pythagoreans offered definitions of a limited range of things on the basis of numbers; examples are timeliness, justice and marriage. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Aristotle - Metaphysics 1078b |
| 553 | Pythagoreans think mathematical principles are the principles of all of nature [Pythagoras, by Aristotle] |
| Full Idea: The Pythagoreans thought that the principles of mathematical entities were the principles of all entities. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Aristotle - Metaphysics 985b |
| 554 | Pythagoreans say things imitate numbers, but Plato says things participate in numbers [Pythagoras, by Aristotle] |
| Full Idea: Pythagoreans said that entities existed by imitation of the numbers, whereas Plato said that it was by participation. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Aristotle - Metaphysics 987b |
| 644 | For Pythagoreans the entire universe is made of numbers [Pythagoras, by Aristotle] |
| Full Idea: For Pythagoreans the entire universe is constructed of numbers. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Aristotle - Metaphysics 1080b |
| 7467 | The modern idea of an immortal soul was largely created by Pythagoras [Pythagoras, by Watson] |
| Full Idea: The modern concept of the immortal soul is a Greek idea, which owes much to Pythagoras. | |
| From: report of Pythagoras (reports [c.530 BCE]) by Peter Watson - Ideas Ch.5 | |
| A reaction: You can see why it caught on - it is a very appealing idea. Watson connects the 'modern' view with the ideas of heaven and hell. Obviously the idea of an afterlife goes a long way back (judging from the contents of ancient graves). |