Search Results for ""

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 map is a way of associating unique objects to every element in a given set. So a map f:A|->B from A to B is a function f such that for every a in A, there is a unique ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...

A Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point ...

Let (A,<=) be a well ordered set. Then the set {a in A:a<k} for some k in A is called an initial segment of A (Rubin 1967, p. 161; Dauben 1990, pp. 196-197; Moore 1982, pp. ...

A pathwise-connected domain is said to be simply connected (also called 1-connected) if any simple closed curve can be shrunk to a point continuously in the set. If the ...

Let L be an extension field of K, denoted L/K, and let G be the set of automorphisms of L/K, that is, the set of automorphisms sigma of L such that sigma(x)=x for every x in ...

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

Let P(z) and Q(z) be univariate polynomials in a complex variable z, and let the polynomial degrees of P and Q satisfy deg(Q)>=deg(P+2). Then int_gamma(P(z))/(Q(z))dz = ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...