You are here: irt.org | FOLDOC | discrete preorder
<mathematics> A preorder is said to be discrete if any two of its elements are incomparable.
(1995-09-21)
Nearby terms: discrete « discrete cosine transform « discrete Fourier transform « discrete preorder » discriminated union » discussion group » Disiple
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL