Ordinal Notation
   HOME
*





Ordinal Notation
In mathematical logic and set theory, an ordinal notation is a partial function mapping the set of all finite sequences of symbols, themselves members of a finite alphabet, to a countable set of ordinals. A Gödel numbering is a function mapping the set of well-formed formulae (a finite sequence of symbols on which the ordinal notation function is defined) of some formal language to the natural numbers. This associates each well-formed formula with a unique natural number, called its Gödel number. If a Gödel numbering is fixed, then the subset relation on the ordinals induces an ordering on well-formed formulae which in turn induces a well-ordering on the subset of natural numbers. A recursive ordinal notation must satisfy the following two additional properties: # the subset of natural numbers is a recursive set # the induced well-ordering on the subset of natural numbers is a recursive relation There are many such schemes of ordinal notations, including schemes by Wilhelm Acke ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Mathematical Logic
Mathematical logic is the study of logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and Mathematical analysis, analysis. In the early 20th century it was shaped by David Hilbert's Hilbert's program, program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in pr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


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. Consequently, they are not reachable from 0 via a finite series of applications of the chosen exponential map and of "weaker" operations like addition and multiplication. The original epsilon numbers were introduced by Georg Cantor in the context of ordinal arithmetic; they are the ordinal numbers ''ε'' that satisfy the equation :\varepsilon = \omega^\varepsilon, \, in which ω is the smallest infinite ordinal. The least such ordinal is ''ε''0 (pronounced epsilon nought or epsilon zero), which can be viewed as the "limit" obtained by transfinite recursion from a sequence of smaller limit ordinals: :\varepsilon_0 = \omega^ = \sup \\,, where is the supremum function, which is equivalent to set union in the case of the von Neumann representation of ordinals. Larger ordinal fixed points of the exponential map are indexed by ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Large Veblen Ordinal
In mathematics, the large Veblen ordinal is a certain large countable ordinal, named after Oswald Veblen. There is no standard notation for ordinals beyond the Feferman–Schütte ordinal Γ0. Most systems of notation use symbols such as ψ(α), θ(α), ψα(β), some of which are modifications of the Veblen function In mathematics, the Veblen functions are a hierarchy of normal functions ( continuous strictly increasing functions from ordinals to ordinals), introduced by Oswald Veblen in . If φ0 is any normal function, then for any non-zero ordinal α, φ ...s to produce countable ordinals even for uncountable arguments, and some of which are ordinal collapsing functions. The large Veblen ordinal is sometimes denoted by \phi_(0) or \theta(\Omega^\Omega) or \psi(\Omega^). It was constructed by Veblen using an extension of Veblen functions allowing infinitely many arguments. References * * {{Number-stub Ordinal numbers ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Small Veblen Ordinal
In mathematics, the small Veblen ordinal is a certain large countable ordinal, named after Oswald Veblen. It is occasionally called the Ackermann ordinal, though the Ackermann ordinal described by is somewhat smaller than the small Veblen ordinal. There is no standard notation for ordinals beyond the Feferman–Schütte ordinal \Gamma_0. Most systems of notation use symbols such as \psi(\alpha), \theta(\alpha), \psi_\alpha(\beta), some of which are modifications of the Veblen functions to produce countable ordinals even for uncountable arguments, and some of which are "collapsing functions". The small Veblen ordinal \theta_(0) or \psi(\Omega^) is the limit of ordinals that can be described using a version of Veblen functions with finitely many arguments. It is the ordinal that measures the strength of Kruskal's theorem. It is also the ordinal type of a certain ordering of rooted tree In graph theory, a tree is an undirected graph in which any two vertices are connected by ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Feferman–Schütte Ordinal
In mathematics, the Feferman–Schütte ordinal Γ0 is a large countable ordinal. It is the proof-theoretic ordinal of several mathematical theories, such as arithmetical transfinite recursion. It is named after Solomon Feferman and Kurt Schütte, the former of whom suggested the name Γ0. There is no standard notation for ordinals beyond the Feferman–Schütte ordinal. There are several ways of representing the Feferman–Schütte ordinal, some of which use ordinal collapsing function In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining ( notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger ...s: \psi(\Omega^\Omega), \theta(\Omega), \varphi_\Omega(0), or \varphi(1,0,0). Definition The Feferman–Schütte ordinal can be defined as the smallest ordinal that cannot be obtained by starting with 0 and using the operations of ordinal addition an ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''Cardinal number, cardinal numbers'', and numbers used for ordering are called ''Ordinal number, ordinal numbers''. Natural numbers are sometimes used as labels, known as ''nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports Number (sports), jersey numbers). Some definitions, including the standard ISO/IEC 80000, ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Recursively Enumerable Set
In computability theory, a set ''S'' of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if: *There is an algorithm such that the set of input numbers for which the algorithm halts is exactly ''S''. Or, equivalently, *There is an enumeration algorithm, algorithm that enumerates the members of ''S''. That means that its output is simply a list of all the members of ''S'': ''s''1, ''s''2, ''s''3, ... . If ''S'' is infinite, this algorithm will run forever. The first condition suggests why the term ''semidecidable'' is sometimes used. More precisely, if a number is in the set, one can ''decide'' this by running the algorithm, but if the number is not in the set, the algorithm runs forever, and no information is returned. A set that is "completely decidable" is a computable set. The second condition suggests why ''computably enumerable'' is used. The abbreviations ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ordinal Arithmetic
In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an explicit well-ordered set that represents the result of the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. In addition to these usual ordinal operations, there are also the "natural" arithmetic of ordinals and the nimber operations. Addition The union of two disjoint well-ordered sets ''S'' and ''T'' can be well-ordered. The order-type of that union is the ordinal that results from adding the order-types of ''S'' and ''T''. If two well-ordered sets are not already disjoint, then they can be replaced by order-isomorphic disjoint sets, e.g. replace ''S'' by × ''S'' and ''T'' by × ''T''. This way, the well-ordered set ''S'' is written "to the left" of the well-ordered ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Computable Function
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithms, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.e. given an input of the function domain it can return the corresponding output. Computable functions are used to discuss computability without referring to any concrete model of computation such as Turing machines or register machines. Any definition, however, must make reference to some specific model of computation but all valid definitions yield the same class of functions. Particular models of computability that give rise to the set of computable functions are the Turing-computable functions and the general recursive functions. Before the precise definition of computable function, mathematicians often used the informal term ''effectively calculable''. This term has since come to be identified with the com ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Church–Kleene Ordinal
In mathematics, particularly set theory, non-recursive ordinals are large countable ordinals greater than all the recursive ordinals, and therefore can not be expressed using ordinal collapsing functions. The Church–Kleene ordinal and variants The smallest non-recursive ordinal is the Church Kleene ordinal, \omega_1^, named after Alonzo Church and S. C. Kleene; its order type is the set of all recursive ordinals. Since the successor of a recursive ordinal is recursive, the Church–Kleene ordinal is a limit ordinal. It is also the smallest ordinal that is not hyperarithmetical, and the smallest admissible ordinal after (an ordinal ''α'' is called admissible if L_\alpha \models \mathsf.). The \omega_1^-recursive subsets of are exactly the \Delta^1_1 subsets of .D. MadoreA Zoo of Ordinals(2017). Accessed September 2021. The notation \omega_1^ is in reference to , the first uncountable ordinal, which is the set of all countable ordinals, analogously to how the Church-Kleene ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


First Uncountable Ordinal
In mathematics, the first uncountable ordinal, traditionally denoted by \omega_1 or sometimes by \Omega, is the smallest ordinal number that, considered as a set, is uncountable. It is the supremum (least upper bound) of all countable ordinals. When considered as a set, the elements of \omega_1 are the countable ordinals (including finite ordinals), of which there are uncountably many. Like any ordinal number (in von Neumann's approach), \omega_1 is a well-ordered set, with set membership serving as the order relation. \omega_1 is a limit ordinal, i.e. there is no ordinal \alpha such that \omega_1 = \alpha+1. The cardinality of the set \omega_1 is the first uncountable cardinal number, \aleph_1 (aleph-one). The ordinal \omega_1 is thus the initial ordinal of \aleph_1. Under the continuum hypothesis, the cardinality of \omega_1 is \beth_1, the same as that of \mathbb—the set of real numbers. In most constructions, \omega_1 and \aleph_1 are considered equal as sets. To generalize ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ackermann Ordinal
In mathematics, the Ackermann ordinal is a certain large countable ordinal, named after Wilhelm Ackermann. The term "Ackermann ordinal" is also occasionally used for the small Veblen ordinal, a somewhat larger ordinal. Unfortunately there is no standard notation for ordinals beyond the Feferman–Schütte ordinal Γ0. Most systems of notation use symbols such as ψ(α), θ(α), ψα(β), some of which are modifications of the Veblen function In mathematics, the Veblen functions are a hierarchy of normal functions ( continuous strictly increasing functions from ordinals to ordinals), introduced by Oswald Veblen in . If φ0 is any normal function, then for any non-zero ordinal α, φ ...s to produce countable ordinals even for uncountable arguments, and some of which are " collapsing functions". The last one is an extension of the Veblen functions for more than 2 arguments. The smaller Ackermann ordinal is the limit of a system of ordinal notations invented by , and is some ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]