Search Results for ""

Whitehead and Russell (1927) devised a hierarchy of "types" in order to eliminate self-referential statements from Principia Mathematica, which purported to derive all of ...

Let L be a language of first-order predicate logic, let I be an indexing set, and for each i in I, let A_i be a structure of the language L. Let u be an ultrafilter in the ...

An unduloid, also called an onduloid, is a surface of revolution with constant nonzero mean curvature. It is a roulette obtained from the path described by the foci of a ...

A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

Consider expressions built up from variables and constants using function symbols. If v_1, ..., v_n are variables and t_1, ..., t_n are expressions, then a set of mappings ...

A "pointwise-bounded" family of continuous linear operators from a Banach space to a normed space is "uniformly bounded." Symbolically, if sup||T_i(x)|| is finite for each x ...

A particle P is said to be undergoing uniform circular motion if its radius vector in appropriate coordinates has the form (x(t),y(t),0), where x(t) = Rcos(omegat) (1) y(t) = ...

A left Hilbert Algebra A whose involution is an antilinear isometry is called a unimodular Hilbert algebra. The involution is usually denoted xi|->xi^*.

The union of two sets A and B is the set obtained by combining the members of each. This is written A union B, and is pronounced "A union B" or "A cup B." The union of sets ...