Search Results for ""

A unar is an algebra A=(A,f), where f is a single unary operation.

Two quantities a and b which are not equal are said to be unequal, and this relationship can be denoted a!=b.

The series sum_(j=1)^(infty)f_j(z) is said to be uniformly Cauchy on compact sets if, for each compact K subset= U and each epsilon>0, there exists an N>0 such that for all ...

A union-closed set is a nonempty finite collection of distinct nonempty finite sets which is closed under union.

A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...

Let A be a C^*-algebra, then two element a,b of A are called unitarily equivalent if there exists a unitary u in A such that b=uau^*.

An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

The quantifier "for all" ( forall ), sometimes also known as the "general quantifier."

A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...

A position in a game is unsafe for player A if the person who plays next (player B) can win. Every unsafe position can be made safe by at least one move.