Search Results for ""

Let P=(P,<=) be a partially ordered set, and let x,y,z in P. If x<=y<=z, then y is said to be between x and z. If y is between x and z and y not in {x,z}, then y is strictly ...

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

Let C be a category. Then D is said to be a subcategory of C, if the objects of D are also objects of C, if the morphisms of D are also morphisms of C, and if D is a category ...

Giving a set F={f_1,f_2,...,f_n} of contracting similitudes of R^l, the closed set E is said to be subselfsimilar for F if E subset union _(i=1)^nf_i(E) (Falconer 1995, ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...

Summation by parts for discrete variables is the equivalent of integration by parts for continuous variables Delta^(-1)[v(x)Deltau(x)]=u(x)v(x)-Delta^(-1)[Eu(x)Deltav(x)], ...

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

A set containing all elements of a smaller set. If B is a subset of A, then A is a superset of B, written A superset= B. If A is a proper superset of B, this is written A ...

A syllogism, also known as a rule of inference, is a formal logical scheme used to draw a conclusion from a set of premises. An example of a syllogism is modus ponens.