Communication
Install
Faster access than browser!

# Ordinal number

In set theory, an ordinal number, or ordinal, is the order type of a well-ordered set. [1]

74 relations: Additively indecomposable ordinal, Akihiro Kanamori, Aleph number, Axiom of choice, Axiom of dependent choice, Axiom of regularity, Axiom of union, Bijection, Burali-Forti paradox, Cardinal number, Cardinality, Church–Kleene ordinal, Club set, Cofinal (mathematics), Cofinality, Cofiniteness, Computable function, Counting, Derived set (mathematics), Discrete space, Epsilon numbers (mathematics), Equivalence class, Equivalence relation, Finite set, First uncountable ordinal, Formal system, Georg Cantor, GNU General Public License, Hereditary property, Idempotence, If and only if, Infimum and supremum, Infinite set, Injective function, Integer, Isomorphism, John Horton Conway, John von Neumann, Limit ordinal, Limit point, Maxima and minima, Natural number, New Foundations, Non-well-founded set theory, Order isomorphism, Order topology, Order type, Ordinal arithmetic, Partially ordered set, Patrick Suppes, ... Expand index (24 more) »

In set theory, a branch of mathematics, an additively indecomposable ordinal &alpha; is any ordinal number that is not 0 such that for any \beta,\gamma, we have \beta+\gamma The class of additively indecomposable ordinals (aka gamma numbers) is denoted \mathbb.

## Akihiro Kanamori

(October 23, 1948, Tokyo, Japan) is a Japanese-born American mathematician.

## Aleph number

In set theory, a discipline within mathematics, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets.

## Axiom of choice

In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that the Cartesian product of a collection of non-empty sets is non-empty.

## Axiom of dependent choice

In mathematics, the axiom of dependent choice, denoted DC, is a weak form of the axiom of choice (AC) that is still sufficient to develop most of real analysis.

## Axiom of regularity

In mathematics, the axiom of regularity (also known as the axiom of foundation) is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic the axiom reads: The axiom implies that no set is an element of itself, and that there is no infinite sequence (an) such that ai+1 is an element of ai for all i. With the axiom of dependent choice (which is a weakened form of the axiom of choice), this result can be reversed: if there are no such infinite sequences, then the axiom of regularity is true.

## Axiom of union

In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of union is one of the axioms of Zermelo–Fraenkel set theory, stating that, for any set x there is a set y whose elements are precisely the elements of the elements of x. Together with the axiom of pairing this implies that for any two sets, there is a set that contains exactly the elements of both.

## Bijection

In mathematics, a bijection, bijective function or one-to-one correspondence is a function between the elements of two sets, where every element of one set is paired with exactly one element of the other set, and every element of the other set is paired with exactly one element of the first set.

In set theory, a field of mathematics, the Burali-Forti paradox demonstrates that naïvely constructing "the set of all ordinal numbers" leads to a contradiction and therefore shows an antinomy in a system that allows its construction.

## Cardinal number

In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets.

## Cardinality

In mathematics, the cardinality of a set is a measure of the "number of elements of the set".

## Church–Kleene ordinal

In mathematics, the Church–Kleene ordinal, \omega^_1, named after Alonzo Church and S. C. Kleene, is a large countable ordinal.

## Club set

In mathematics, particularly in mathematical logic and set theory, a club set is a subset of a limit ordinal which is closed under the order topology, and is unbounded (see below) relative to the limit ordinal.

## Cofinal (mathematics)

In mathematics, let A be a set and let ≤ be a binary relation on A. Then a subset B of A is said to be cofinal if it satisfies the following condition: This definition is most commonly applied when A is a partially ordered set or directed set under the relation ≤. Cofinal subsets are very important in the theory of directed sets and nets, where “cofinal subnet” is the appropriate generalization of “subsequence”.

## Cofinality

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A. This definition of cofinality relies on the axiom of choice, as it uses the fact that every non-empty set of cardinal numbers has a least member.

## Cofiniteness

In mathematics, a cofinite subset of a set X is a subset A whose complement in X is a finite set.

## Computable function

Computable functions are the basic objects of study in computability theory.

## Counting

Counting is the action of finding the number of elements of a finite set of objects.

## Derived set (mathematics)

In mathematics, more specifically in point-set topology, the derived set of a subset S of a topological space is the set of all limit points of S. It is usually denoted by S'.

## Discrete space

In topology, a discrete space is a particularly simple example of a topological space or similar structure, one in which the points form a discontinuous sequence, meaning they are isolated from each other in a certain sense.

## Epsilon numbers (mathematics)

In mathematics, the epsilon numbers are a collection of transfinite numbers whose defining property is that they are fixed points of an exponential map.

## Equivalence class

In mathematics, when a set has an equivalence relation defined on its elements, there is a natural grouping of elements that are related to one another, forming what are called equivalence classes.

## Equivalence relation

In mathematics, an equivalence relation is the relation that holds between two elements if and only if they are members of the same cell within a set that has been partitioned into cells such that every element of the set is a member of one and only one cell of the partition.

## Finite set

In mathematics, a finite set is a set that has a finite number of elements.

## First uncountable ordinal

In mathematics, the first uncountable ordinal, traditionally denoted by ω1 or sometimes by Ω, is the smallest ordinal number that, considered as a set, is uncountable.

## Formal system

A formal system is broadly defined as any well-defined system of abstract thought based on the model of mathematics.

## Georg Cantor

Georg Ferdinand Ludwig Philipp Cantor (– January 6, 1918) was a German mathematician.

The GNU General Public License (GNU GPL or GPL) is the most widely used free software license, which guarantees end users (individuals, organizations, companies) the freedoms to run, study, share (copy), and modify the software.

## Hereditary property

In mathematics, a hereditary property is a property of an object, that inherits to all its subobjects, where the term subobject depends on the context.

## Idempotence

Idempotence is the property of certain operations in mathematics and computer science, that can be applied multiple times without changing the result beyond the initial application.

## If and only if

In logic and related fields such as mathematics and philosophy, if and only if (shortened iff) is a biconditional logical connective between statements.

## Infimum and supremum

In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set T is the greatest element that is less than or equal to all elements of S, if such an element exists.

## Infinite set

In set theory, an infinite set is a set that is not a finite set.

## Injective function

In mathematics, an injective function or injection or one-to-one function is a function that preserves distinctness: it never maps distinct elements of its domain to the same element of its codomain.

## Integer

An integer (from the Latin ''integer'' meaning "whole")Integer&#x2009;'s first, literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").

## Isomorphism

In mathematics, an isomorphism (from the Ancient Greek: ἴσος isos "equal", and μορφή morphe "form" or "shape") is a homomorphism (or more generally a morphism) that admits an inverse.

## John Horton Conway

John Horton Conway FRS (born 26 December 1937) is a British mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory.

## John von Neumann

John von Neumann (Hungarian: Neumann János,; December 28, 1903 – February 8, 1957) was a Hungarian-American pure and applied mathematician, physicist, inventor, polymath, and polyglot.

## Limit ordinal

In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal.

## Limit point

In mathematics, a limit point of a set S in a topological space X is a point x (which is in X, but not necessarily in S) that can be "approximated" by points of S in the sense that every neighbourhood of x with respect to the topology on X also contains a point of S other than x itself.

## Maxima and minima

In mathematical analysis, the maxima and minima (the plural of maximum and minimum) of a function, known collectively as extrema (the plural of extremum), are the largest and smallest value of the function, either within a given range (the local or relative extrema) or on the entire domain of a function (the global or absolute extrema).

## Natural number

In mathematics, the natural numbers (sometimes called the whole numbers): "whole number An integer, though sometimes it is taken to mean only non-negative integers, or just the positive integers." give definitions of "whole number" under several headwords: INTEGER … Syn. whole number.

## New Foundations

In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica.

## Non-well-founded set theory

Non-well-founded set theories are variants of axiomatic set theory that allow sets to contain themselves and otherwise violate the rule of well-foundedness.

## Order isomorphism

In the mathematical field of order theory an order isomorphism is a special kind of monotone function that constitutes a suitable notion of isomorphism for partially ordered sets (posets).

## Order topology

In mathematics, an order topology is a certain topology that can be defined on any totally ordered set.

## Order type

In mathematics, especially in set theory, two ordered sets X,Y are said to have the same order type just when they are order isomorphic, that is, when there exists a bijection (each element matches exactly one in the other set) f: X &rarr; Y such that both f and its inverse are strictly increasing (order preserving i.e. the matching elements are also in the correct order).

## Ordinal arithmetic

In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation.

## Partially ordered set

In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set.

## Patrick Suppes

Patrick Colonel Suppes (March 17, 1922 – November 17, 2014) was an American philosopher who made significant contributions to philosophy of science, the theory of measurement, the foundations of quantum mechanics, decision theory, psychology and educational technology.

## Peano axioms

In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano.

## Principia Mathematica

The Principia Mathematica is a three-volume work on the foundations of mathematics, written by Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913.

## Richard K. Guy

Richard Kenneth Guy (born 30 September 1916 in Nuneaton, England) is a British mathematician, Professor Emeritus in the Department of Mathematics at the University of Calgary.

## Sequence

In mathematics, a sequence is an ordered collection of objects in which repetitions are allowed.

## Set (mathematics)

In mathematics, a set is a collection of distinct objects, considered as an object in its own right.

## Set theory

Set theory is the branch of mathematical logic that studies sets, which informally are collections of objects.

Springer Science+Business Media or Springer is a global publishing company that publishes books, e-books and peer-reviewed journals in science, technical and medical (STM) publishing.

## Subset

In mathematics, especially in set theory, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B, that is, all elements of A are also elements of B. A and B may coincide.

## Successor ordinal

In set theory, the successor of an ordinal number α is the smallest ordinal number greater than α.

## Surjective function

In mathematics, a function f from a set X to a set Y is surjective (or onto), or a surjection, if every element y in Y has a corresponding element x in X such that f(x).

## Topological space

In topology and related branches of mathematics, a topological space may be defined as a set of points, along with a set of neighbourhoods for each point, that satisfy a set of axioms relating points and neighbourhoods.

## Total order

In mathematics, a linear order, total order, simple order, or (non-strict) ordering is a binary relation (here denoted by infix ≤) on some set X which is transitive, antisymmetric, and total.

## Transfinite induction

Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers.

## Transitive set

In set theory, a set A is transitive, if and only if.

## Trichotomy (mathematics)

In mathematics, the law of trichotomy states that every real number is either positive, negative, or zero.

## Trigonometric series

A trigonometric series is a series of the form: It is called a Fourier series if the terms A_ and B_ have the form: where f is an integrable function.

## Type theory

In mathematics, logic, and computer science, a type theory is any of a class of formal systems, some of which can serve as alternatives to set theory as a foundation for all mathematics.

## Up to

In mathematics, the phrase up to indicates that its grammatical object is some equivalence class, to be regarded as a single entity, or disregarded as a single entity.

## Upper set

In mathematics, an upper set (also called an upward closed set or just an upset) of a partially ordered set (X,&le) is a subset U with the property that, if x is in U and x≤y, then y is in U. The dual notion is lower set (alternatively, down set, decreasing set, initial segment, semi-ideal; the set is downward closed), which is a subset L with the property that, if x is in L and y≤x, then y is in L. The terms order ideal or ideal are sometimes used as synonyms for lower set.

## Urelement

In set theory, a branch of mathematics, an urelement or ur-element (from the German prefix ur-, 'primordial') is an object (concrete or abstract) that is not a set, but that may be an element of a set.

## Von Neumann cardinal assignment

The von Neumann cardinal assignment is a cardinal assignment which uses ordinal numbers.

## Well-order

In mathematics, a well-order relation (or well-ordering) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering.

## Zermelo–Fraenkel set theory

In mathematics, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is one of several axiomatic systems that were proposed in the early twentieth century to formulate a theory of sets free of paradoxes such as Russell's paradox.

## 0 (number)

0 (zero; BrE: or AmE) is both a number and the numerical digit used to represent that number in numerals.

## References

Hey! We are on Facebook now! »