inclusion in a set
21Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… …
22Implementation of mathematics in set theory — This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC (the dominant set theory) and in NFU, the version of Quine s New… …
23Convex set — A convex set …
24Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… …
25Instruction set — An instruction set, or instruction set architecture (ISA), is the part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception… …
26Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… …
27Descriptive set theory — In mathematical logic, descriptive set theory is the study of certain classes of well behaved subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other… …
28Hitting set — The hitting set problem is an NP complete problem in set theory.For a given list of sets, a hitting set is a set of elements so that each set in the given list is touched by the hitting set.In the hitting set problem, the task is to find a small… …
29Delta set — In mathematics, a delta set (or Δ set) S is a combinatorial object that is useful in the construction and triangulation of topological spaces, and also in the computation of related algebraic invariants of such spaces. A delta set is somewhat… …
30Transitive set — In set theory, a set (or class) A is transitive, if * whenever x ∈ A , and y ∈ x , then y ∈ A , or, equivalently, * whenever x ∈ A , and x is not an urelement, then x is a subset of A .The transitive closure of a set A is the smallest (with… …
