This preview shows page 1. Sign up to view the full content.
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 satisy 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
This note was uploaded on 01/02/2010 for the course MATH Math2009 taught by Professor Koskesh during the Spring '09 term at SUNY Empire State.
 Spring '09
 Koskesh
 Math, Sets

Click to edit the document details