Search Results for ""

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). ...

The tetranacci constant is ratio to which adjacent tetranacci numbers tend, and is given by T = (x^4-x^3-x^2-x-1)_2 (1) = 1.92756... (2) (OEIS A086088), where (P(x))_n ...

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 topological algebra is a pair (A,tau), where A=(A,(f_i^A)_(i in I)) is an algebra and each of the operations f_i^A is continuous in the product topology. Examples of ...

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 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 ...

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 ...