Search Results for ""
641 - 650 of 3024 for Well Ordered SetSearch Results
Proper covers are defined as covers of a set X which do not contain the entire set X itself as a subset (Macula 1994). Of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...
Consider a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then the Herbrand universe H of S is defined by the following rules. 1. All constants ...
A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...
1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.
The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.
A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.
Let V be a vector space over a field K, and let A be a nonempty set. For an appropriately defined affine space A, K is called the coefficient field.
The cotangent bundle of a manifold is similar to the tangent bundle, except that it is the set (x,f) where x in M and f is a dual vector in the tangent space to x in M. The ...
The simplest algebraic language, denoted D. If X is the alphabet {x,x^_}, then D is the set of words u of X which satisfy 1. |u|_x=|u|_(x^_), where |u|_x is the numbers of ...
For an atomic integral domain R (i.e., one in which every nonzero nonunit can be factored as a product of irreducible elements) with I(R) the set of irreducible elements, the ...
...
View search results from all Wolfram sites (37299 matches)

