You are here: irt.org | FOLDOC | directed set
<theory> A set X is directed under some relation, <= (less
than or equal), if it is non-empty and if for any two elements
x and y there exists an element z such that x <= z and y <= z.
I.e. all pairs have an upper bound.
Nearby terms: directed acyclic graph « directed graph « Directed Oc « directed set » Direct Inward Dialing » directional coupler » Directly Executable Test Oriented Language
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
©2018 Martin Webb