Search Results for ""

Let I(x,y) denote the set of all vertices lying on an (x,y)-graph geodesic in G, then a set S with I(S)=V(G) is called a geodetic set in G and is denoted g(G).

The Cantor diagonal method, also called the Cantor diagonal argument or Cantor's diagonal slash, is a clever technique used by Georg Cantor to show that the integers and ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

The closure of a set A is the smallest closed set containing A. Closed sets are closed under arbitrary intersection, so it is also the intersection of all closed sets ...

A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

In a topological space X, an open neighborhood of a point x is an open set containing x. A set containing an open neighborhood is simply called a neighborhood.

The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...