Search Results for ""

A set P is called perfect if P=P^', where P^' is the derived set of P.

A definable set which is the complement of an analytic set.

A set whose members index (label) members of another set. For example, in the set A= union _(k in K)A_k, the set K is an index set of the set A.

A definable set, also called a Souslin set.

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...

A hom-set of a category C is a set of morphisms of C.

In a lattice, any two elements a and b have a least upper bound. This least upper bound is often called the join of a and b, and is denoted by a v b. One can also speak of ...

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

The limit points of a set P, denoted P^'.