integer set
31Definable set — In mathematical logic, a definable set is an n ary relation on the domain of a structure whose elements are precisely those elements satisfying some formula in the language of that structure. A set can be defined with or without parameters, which …
32Kuratowski's free set theorem — Kuratowski s free set theorem, named after Kazimierz Kuratowski, is a result of set theory, an area of mathematics. It is a result which has been largely forgotten for almost 50 years, but has been applied recently in solving several lattice… …
33Visual Instruction Set — Visual Instruction Set, or VIS, is a SIMD instruction set for SPARC CPUs, implemented on all UltraSPARC and some SPARC64 processors.There are three versions of VIS. VIS 1.0 and VIS 2.0 are included in existing SPARC processor designs; VIS 3.0 is… …
34Blum integer — In mathematics, more specifically in number theory, a natural number n is a Blum integer if n = pq is a semiprime for which p and q are distinct prime numbers congruent to 3 mod 4. That is, p and q must be of the form 4 t +3, for some integer t …
35Finite 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… …
36Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… …
37Open set — Example: The points (x, y) satisfying x2 + y2 = r2 are colored blue. The points (x, y) satisfying x2 + y2 < r2 are colored red. The red points form an open set. The blue points form a closed set. The union of the red and blue points is a… …
38Recursively 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… …
39Small set (combinatorics) — In combinatorial mathematics, a small set of positive integers:S = {s 0,s 1,s 2,s 3,dots}is one such that the infinite sum:frac{1}{s 0}+frac{1}{s 1}+frac{1}{s 2}+frac{1}{s 3}+cdots converges. A large set is any other set of positive integers (i.e …
40Infinite set — In set theory, an infinite set is a set that is not a finite set. Infinite sets may be countable or uncountable. Some examples are: * the set of all integers, {..., 1, 0, 1, 2, ...}, is a countably infinite set; and * the set of all real numbers… …
