Unformatted text preview: b are in some sense indistinguishable. ²or example, imagine that we have a set o± programs and we have various demands to make o± them: ±or example, we might require that the programs • always terminate; • cost less than a hundred pounds; • compute π to 100 decimal places; • . . . Even though two programs are not equal, they can satis±y the same demands and so be ‘equal enough’ ±or our purposes. In such a case, we say that two programs are equivalent . D EFINITION 3.13 Let A be a set and R a binary relation on A . The relation R is an equivalence relation i± and only i± R is refexive, symmetric and transitive. We sometimes just say that R is an equivalence . 25...
View
Full Document
 Spring '09
 Koskesh
 Math, Sets, Equivalence relation, Binary relation, Transitive relation, Symmetric relation, relation

Click to edit the document details