determine if intersection of a set with conjunction of two other sets is empty

Posted by koen on Stack Overflow See other posts from Stack Overflow or by koen
Published on 2010-04-13T18:31:08Z Indexed on 2010/04/13 18:33 UTC
Read the original article Hit count: 319

For any three given sets A, B and C: is there a way to determine (programmatically) whether there is an element of A that is part of the conjunction of B and C?

example:
A: all numbers greater than 3
B: all numbers lesser than 7
C: all numbers that equal 5

In this case there is an element in set A, being the number 5, that fits. I'm implementing this as specifications, so this numerical range is just an example. A, B, C could be anything.

© Stack Overflow or respective owner

Related posts about set-theory

Related posts about sets