Search Results for ""

A theory is a set of sentences which is closed under logical implication. That is, given any subset of sentences {s_1,s_2,...} in the theory, if sentence r is a logical ...

A topological basis is a subset B of a set T in which all other open sets can be written as unions or finite intersections of B. For the real numbers, the set of all open ...

One of Cantor's ordinal numbers omega, omega+1, omega+2, ..., omega+omega, omega+omega+1, ... which is "larger" than any whole number.

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

The function psi(x)={x(1-(x^2)/(c^2))^2 for |x|<c; 0 for |x|>c (1) sometimes used in robust estimation. It has a minimum at x=-c/sqrt(5) and a maximum at x=c/sqrt(5), where ...

A unar is an algebra A=(A,f), where f is a single unary operation.

A unilateral shift is a weighted shift T for which alpha_n=1 for all n.

A position in a game is unsafe for player A if the person who plays next (player B) can win. Every unsafe position can be made safe by at least one move.

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.