Bounded complete poset
Bounded complete poset In the mathematical field of order theory, a partially ordered set is bounded complete if all of its subsets which have ... partial order can also be called consistently complete, since any upper bound of a ...
http://en.wikipedia.org/wiki/Bounded_complete_poset - 4k - Cached - Similar pages

Complete space
Complete space For Cauchy completion in category theory ... metric space M is said to be complete (or Cauchy) if every Cauchy sequence of ... also in M. Intuitively, a space is complete if it "doesn't have any holes ... For instance, the rational numbers are not complete, because √2 is "missing" even though you ... given by the absolute value, is not complete. Consider for instance the sequence defined ...
http://en.wikipedia.org/wiki/Complete_space - 12k - Cached - Similar pages

Complete lattice
Complete lattice In mathematics, a complete lattice is a partially ordered set in ... a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics ... both in order theory and universal algebra. Complete lattices must not be confused with complete partial orders (cpos), which constitute a ...
http://en.wikipedia.org/wiki/Complete_lattice - 26k - Cached - Similar pages

Almost complete
Almost complete In computer science, a problem is almost complete for a complexity class C if it ... set, in terms of Lutz's resource bounded measure.
http://en.wikipedia.org/wiki/Almost_complete - 0k - Cached - Similar pages

Totally bounded space
Totally bounded space In topology and related branches of mathematics, a totally bounded space, or precompact space, is a space ... subsets. A related notion is a totally bounded set, or precompact set, in which only ... be covered. Every subset of a totally bounded space is a totally bounded set; but even if a space ...
http://en.wikipedia.org/wiki/Totally_bounded_space - 13k - Cached - Similar pages

List of NP-complete problems
List of NP-complete problems Here are some of the more commonly known problems that are NP-complete when expressed as decision problems. This list ... · Covering by cliques · Covering by complete bipartite subgraphs Subgraphs and supergraphs Clique · ... property Pi · Induced path · Balanced complete bipartite subgraph · Bipartite subgraph · Degree-bounded connected subgraph · Planar subgraph · ...
http://en.wikipedia.org/wiki/List_of_NP-complete_problems - 23k - Cached - Similar pages

Talk:Bounded operator
Talk:Bounded operator Does the Laplacian map onto L ... 04, 2 Mar 2005 (UTC) Defined versus bounded I think you are making a mistake ... defined on its domain is not necessarily bounded on that domain. It is essential that ... between topological vector spaces need not be bounded. Continuous linear map redirects here so either ... would prefer the second option and treat bounded linear operator as a special case ...
http://en.wikipedia.org/wiki/Talk:Bounded_operator - 22k - Cached - Similar pages

Complete partial order
Complete partial order In mathematics, directed complete partial orders and complete partial orders are special classes of partially ... A partially ordered set is a directed complete partial order (dcpo), if each of its directed subsets has a supremum. A complete partial order (cpo) is a dcpo ...
http://en.wikipedia.org/wiki/Complete_partial_order - 6k - Cached - Similar pages

Completeness (order theory)
... special use of the term refers to complete partial orders or complete lattices. However, many other interesting notions of ... a least and a greatest element is bounded. However, this should not be confused with the notion of bounded completeness given below. Finite completeness Further simple ... The posets with this property are the complete lattices. However, using the given order, ...
http://en.wikipedia.org/wiki/Completeness_(order_theory) - 29k - Cached - Similar pages

Glossary of order theory
... 0 and x v �x = 1. A bounded poset is one that has a least ... a greatest element 1. A poset is bounded complete if every of its subsets with some ... ≤ y or y ≤ x. A complete Boolean algebra is a Boolean algebra that is a complete lattice. Complete Heyting algebra. A Heyting ...
http://en.wikipedia.org/wiki/Glossary_of_order_theory - 31k - Cached - Similar pages