Unformatted text preview: ; for example, we use the logical notation loves ( x,y ) rather than ( x,y ) ∈ loves . We sometimes write aR b instead of R ( a,b ) ; for example, x loves y or 2 < 5 or a ‘ f ‘ b in Haskell. In general, there will be many relations on any set. A relation does not have to be meaningful; any subset of a Cartesian product is a relation. ±or example, for A = { a,b } , there are sixteen relations on A : ∅ { ( a,b ) , ( b,a ) } { ( a,a ) } { ( a,b ) , ( b,b ) } { ( a,b ) } { ( b,a ) , ( b,b ) } { ( b,a ) } { ( a,a ) , ( a,b ) , ( b,a ) } { ( b,b ) } { ( a,a ) , ( a,b ) , ( b,b ) } { ( a,a ) , ( a,b ) } { ( a,a ) , ( b,a ) , ( b,b ) } { ( a,a ) , ( b,a ) } { ( a,b ) , ( b,a ) , ( b,b ) } { ( a,a ) , ( b,b ) } { ( a,a ) , ( a,b ) , ( b,a ) , ( b,b ) } 15...
View
Full Document
 Spring '09
 Koskesh
 Math, Logic, Set Theory, Binary relation, Cartesian product, Ordered pair

Click to edit the document details