A Dedekind cut is a partition of the rational numbers ℚ into two non-empty sets (A, B), such that every element of A is less than every element of B, and A contains no greatest elemen