Search Results for ""

The formal term in propositional calculus for the connective implies.

Functions which can be expressed in terms of Legendre functions of the first and second kinds. See Abramowitz and Stegun (1972, p. 337). P_(-1/2+ip)(costheta) = (1) = ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A subset A of a vector space V is said to be convex if lambdax+(1-lambda)y for all vectors x,y in A, and all scalars lambda in [0,1]. Via induction, this can be seen to be ...

Suppose that X^~,X are arcwise-connected and locally arcwise-connected topological spaces. Then (X^~,p) is said to be a covering space of X if p:X^~->X is a surjective ...

Two bits or half a nibble. Since a crumb encodes values from 0 to 2^2-1=3, it can conveniently be represented using single quaternary digit. However, the term "crumb" is ...

Attractive compounds can be constructed from the cube 3-compounds and their octahedron 3-compound duals. One is illustrated above. This compound will be implemented in a ...

A cube 35-compound can be constructed as the dual of the octahedron 35-compound. It will be implemented in a future version of the Wolfram Language as ...

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

A continuum is a decomposable continuum if and only if it is the union of two of its proper subcontinua. A continuum that is not decomposable is an indecomposable continuum.