Search Results for ""

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

In nonstandard analysis, the limitation to first-order analysis can be avoided by using a construction known as a superstructure. Superstructures are constructed in the ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

Term rewriting systems are reduction systems in which rewrite rules apply to terms. Terms are built up from variables and constants using function symbols (or operations). ...

Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...

A tube of radius r of a set gamma is the set of points at a distance r from gamma. In particular, if gamma(t) is a regular space curve whose curvature does not vanish, then ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...

Let X be a connected topological space. Then X is unicoherent provided that for any closed connected subsets A and B of X, if X=A union B, then A intersection B is connected. ...

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 uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...