| 9854 | We can introduce new objects, as equivalence classes of objects already known [Frege, by Dummett] |
| Full Idea: We can introduce a new type of object from the obtaining of some equivalence relation between objects of some already known kind, by identifying the new objects as equivalence classes of the old ones under that equivalence relation. | |
| From: report of Gottlob Frege (Grundlagen der Arithmetik (Foundations) [1884]) by Michael Dummett - Frege philosophy of mathematics Ch.14 | |
| A reaction: Some accounts of abstraction merely describe the concept, but this is a rival to the traditional pyschological abstractionism that Frege attacked so vigorously. Should we take a platonist or constructivist view of the new objects? |
| 9883 | Frege introduced the standard device, of defining logical objects with equivalence classes [Frege, by Dummett] |
| Full Idea: Frege decided that all logical objects, or at least all those needed for mathematics, could be defined by logical abstraction, except the classes needed for such definitions. ..This definition by equivalence classes has been adopted as a standard device. | |
| From: report of Gottlob Frege (Grundlagen der Arithmetik (Foundations) [1884], §64-68) by Michael Dummett - Frege philosophy of mathematics | |
| A reaction: This means if we are to understand modern abstraction (instead of the psychological method of ignoring selected properties of objects), we must understand the presuppositions needed for a definition by equivalence. |
| 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) |
| 8920 | Equivalence relations are reflexive, symmetric and transitive, and classify similar objects [Lipschutz] |
| Full Idea: A relation R on a non-empty set S is an equivalence relation if it is reflexive (for each member a, aRa), symmetric (if aRb, then bRa), and transitive (aRb and bRc, so aRc). It tries to classify objects that are in some way 'alike'. | |
| From: Seymour Lipschutz (Set Theory and related topics (2nd ed) [1998], 3.9) | |
| A reaction: So this is an attempt to formalise the common sense notion of seeing that two things have something in common. Presumably a 'way' of being alike is going to be a property or a part |
| 10103 | Grouping by property is common in mathematics, usually using equivalence [George/Velleman] |
| Full Idea: The idea of grouping together objects that share some property is a common one in mathematics, ...and the technique most often involves the use of equivalence relations. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
| 10104 | 'Equivalence' is a reflexive, symmetric and transitive relation; 'same first letter' partitions English words [George/Velleman] |
| Full Idea: A relation is an equivalence relation if it is reflexive, symmetric and transitive. The 'same first letter' is an equivalence relation on the set of English words. Any relation that puts a partition into clusters will be equivalence - and vice versa. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: This is a key concept in the Fregean strategy for defining numbers. |