Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap
irt.Org

lattice

You are here: irt.org | FOLDOC | lattice

<theory> A partially ordered set in which all finite subsets have a least upper bound and greatest lower bound.

This definition has been standard at least since the 1930s and probably since Dedekind worked on lattice theory in the 19th century; though he may not have used that name.

See also complete lattice, domain theory.

(1999-12-09)

Nearby terms: latency « LaTeX « Latin 1 « lattice » LAU » laundromat » LAURE

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