Search Results for ""

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

A subset E of a topological space S is said to be nonmeager if E is of second category in S, i.e., if E cannot be written as the countable union of subsets which are nowhere ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

A subset S of a topological space X is compact if for every open cover of S there exists a finite subcover of S.

A subset A subset= X of a topological space X is said to be disconnected if it is not connected.

Three sets of three lines such that each line is incident with two from both other sets.