Admissible Ordinal
   HOME
*





Admissible Ordinal
In set theory, an ordinal number ''α'' is an admissible ordinal if L''α'' is an admissible set (that is, a transitive model of Kripke–Platek set theory); in other words, ''α'' is admissible when ''α'' is a limit ordinal and L''α'' ⊧ Σ0-collection.. See in particulap. 265. The term was coined by Richard Platek in 1966. The first two admissible ordinals are ω and \omega_1^ (the least non-recursive ordinal, also called the Church–Kleene ordinal). Any regular uncountable cardinal is an admissible ordinal. By a theorem of Sacks, the countable admissible ordinals are exactly those constructed in a manner similar to the Church–Kleene ordinal, but for Turing machines with oracles. One sometimes writes \omega_\alpha^ for the \alpha-th ordinal that is either admissible or a limit of admissibles; an ordinal that is both is called ''recursively inaccessible''. There exists a theory of large ordinals in this manner that is highly parallel to that of (small) large c ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Set Theory
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory. The non-formalized systems investigated during this early stage go under the name of '' naive set theory''. After the discovery of paradoxes within naive set theory (such as Russell's paradox, Cantor's paradox and the Burali-Forti paradox) various axiomatic systems were proposed in the early twentieth century, of which Zermelo–Fraenkel set theory (with or without the axiom of choice) is still the best-known and most studied. Set theory is commonly employed as a foundational ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Countable Set
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements. In more technical terms, assuming the axiom of countable choice, a set is ''countable'' if its cardinality (its number of elements) is not greater than that of the natural numbers. A countable set that is not finite is said countably infinite. The concept is attributed to Georg Cantor, who proved the existence of uncountable sets, that is, sets that are not countable; for example the set of the real numbers. A note on terminology Although the terms "countable" and "countably infinite" as defined here are quite co ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Constructible Universe
In mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted by , is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy . It was introduced by Kurt Gödel in his 1938 paper "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis". In this paper, he proved that the constructible universe is an inner model of ZF set theory (that is, of Zermelo–Fraenkel set theory with the axiom of choice excluded), and also that the axiom of choice and the generalized continuum hypothesis are true in the constructible universe. This shows that both propositions are consistent with the basic axioms of set theory, if ZF itself is consistent. Since many other theorems only hold in systems in which one or both of the propositions is true, their consistency is an important result. What is can be thought of as being built in "stages" resembling the constr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Large Countable Ordinals
In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations (see ordinal analysis). However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not (for reasons somewhat analogous to the unsolvability of the halting problem); various more-concrete ways of defining ordinals that definitely have notations are available. Since there are only countably many notations, all ordinals with notations are exhausted well below the first uncountable ordinal ω1; their supremum is called ''Church–Kleene'' ω1 or ω1CK (not to be confused with the first uncountable ordinal, ω1), described below. Ordinal numbers below ω1CK are the recursive ordinals (see below). Countable ordinals larger than thi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Alpha Recursion Theory
In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals \alpha. An admissible set is closed under \Sigma_1(L_\alpha) functions, where L_\xi denotes a rank of Godel's constructible hierarchy. \alpha is an admissible ordinal if L_ is a model of Kripke–Platek set theory. In what follows \alpha is considered to be fixed. The objects of study in \alpha recursion are subsets of \alpha. These sets are said to have some properties: *A set A\subseteq\alpha is said to be \alpha-recursively-enumerable if it is \Sigma_1 definable over L_\alpha, possibly with parameters from L_\alpha in the definition. *A is \alpha-recursive if both A and \alpha \setminus A (its relative complement in \alpha) are \alpha-recursively-enumerable. It's of note that \alpha-recursive sets are members of L_ by definition of L. *Members of L_\alpha are called \alpha-finite and play a similar role to the finite numbers in classical recursion theory. *Members ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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. The cardinality of a finite set is a natural number: the number of elements in the set. The ''transfinite'' cardinal numbers, often denoted using the Hebrew symbol \aleph ( aleph) followed by a subscript, describe the sizes of infinite sets. Cardinality is defined in terms of bijective functions. Two sets have the same cardinality if, and only if, there is a one-to-one correspondence (bijection) between the elements of the two sets. In the case of finite sets, this agrees with the intuitive notion of size. In the case of infinite sets, the behavior is more complex. A fundamental theorem due to Georg Cantor shows that it is possible for infinite sets to have different cardinalities, and in particular the cardinality of the set of real numbers is greater than the cardinality of the set of natural numbers. It is also possible for ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Mahlo Cardinal
In mathematics, a Mahlo cardinal is a certain kind of large cardinal number. Mahlo cardinals were first described by . As with all large cardinals, none of these varieties of Mahlo cardinals can be proven to exist by ZFC (assuming ZFC is consistent). A cardinal number \kappa is called strongly Mahlo if \kappa is strongly inaccessible and the set U = \ is stationary in κ. A cardinal \kappa is called weakly Mahlo if \kappa is weakly inaccessible and the set of weakly inaccessible cardinals less than \kappa is stationary in \kappa. The term "Mahlo cardinal" now usually means "strongly Mahlo cardinal", though the cardinals originally considered by Mahlo were weakly Mahlo cardinals. Minimal condition sufficient for a Mahlo cardinal * If κ is a limit ''ordinal'' and the set of regular ordinals less than κ is stationary in κ, then κ is weakly Mahlo. The main difficulty in proving this is to show that κ is regular. We will suppose that it is not regular and construct a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Large Cardinal Property
In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more". There is a rough convention that results provable from ZFC alone may be stated without hypotheses, but that if the proof requires other assumptions (such as the existence of large cardinals), these should be stated. Whether this is simply a linguistic convention, or something more, is a controversial point among distinct philo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Oracle Machine
In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to solve certain problems in a single operation. The problem can be of any complexity class. Even undecidable problems, such as the halting problem, can be used. Oracles An oracle machine can be conceived as a Turing machine connected to an oracle. The oracle, in this context, is an entity capable of solving some problem, which for example may be a decision problem or a function problem. The problem does not have to be computable; the oracle is not assumed to be a Turing machine or computer program. The oracle is simply a "black box" that is able to produce a solution for any instance of a given computational problem: * A decision problem is represented as a set ''A'' of natural numbers (or strings). An instance of the problem is an arbitrary natural number (or string ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Gerald Sacks
Gerald Enoch Sacks (1933 – October 4, 2019) was a logician whose most important contributions were in recursion theory. Named after him is Sacks forcing, a forcing notion based on perfect sets and the Sacks Density Theorem, which asserts that the partial order of the recursively enumerable Turing degrees is dense. Sacks had a joint appointment as a professor at the Massachusetts Institute of Technology and at Harvard University starting in 1972 and became emeritus at M.I.T. in 2006 and at Harvard in 2012. Sacks was born in Brooklyn in 1933. He earned his Ph.D. in 1961 from Cornell University under the direction of J. Barkley Rosser, with his dissertation ''On Suborderings of Degrees of Recursive Insolvability''. Among his notable students are Lenore Blum, Harvey Friedman, Sy Friedman, Leo Harrington, Richard Shore, Steve Simpson and Theodore Slaman Theodore Allen Slaman (born April 17, 1954) is a professor of mathematics at the University of California, Berkeley who works in ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Ordinal Number
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets. A finite set can be enumerated by successively labeling each element with the least natural number that has not been previously used. To extend this process to various infinite sets, ordinal numbers are defined more generally as linearly ordered labels that include the natural numbers and have the property that every set of ordinals has a least element (this is needed for giving a meaning to "the least unused element"). This more general definition allows us to define an ordinal number \omega that is greater than every natural number, along with ordinal numbers \omega + 1, \omega + 2, etc., which are even greater than \omega. A linear order such that every subset has a least element is called a well-order. The axiom of choice implies that every set can be well-ordered, and given two well-ordered sets, one is isomorphic to ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Regular Cardinal
In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that \kappa is a regular cardinal if and only if every unbounded subset C \subseteq \kappa has cardinality \kappa. Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular. In the presence of the axiom of choice, any cardinal number can be well-ordered, and then the following are equivalent for a cardinal \kappa: # \kappa is a regular cardinal. # If \kappa = \sum_ \lambda_i and \lambda_i < \kappa for all i, then , I, \ge \kappa. # If S = \bigcup_ S_i, and if , I, < \kappa and , S_i, < \kappa for all i, then , S, < \kappa. # The