about the mathematical concept number words denoting a position in a sequence first , second , third , etc. Ordinalnumber linguistics Image omega exp omega.svg thumb 250px Representation of the ordinal ... theory , an ordinalnumber , or just ordinal , is the order type of a well order well ordered set ..., but they become more and more difficult to describe. Any ordinalnumber can be made into a topological ... as an equivalence class The original definition of ordinalnumber, found for example in Principia ... order isomorphic to that well ordering in other words, an ordinalnumber is genuinely an equivalence ... set that canonically represents the class. Thus, an ordinalnumber will be a well ordered set and every well ordered set will be order isomorphic to exactly one ordinalnumber. The standard definition .... On the other hand, does not have a maximum since there is no largest natural number. If an ordinal ..., a natural number we can find another ordinal natural number larger than it, but still less ... that any well ordered set is similar order isomorphic to a unique ordinalnumber math alpha .... Every finite ordinal natural number is initial, but most infinite ordinals are not initial. The axiom ... cardinal has an initial ordinal. In this case, it is traditional to identify the cardinal number with its ... links Wiktionary ordinal MathWorld urlname OrdinalNumber title OrdinalNumber http www.apronus.com ... GPL d free software for computing with ordinals and ordinal notations countable ordinals Number ... of the natural number s different from integer s and from cardinal number cardinal s. Like ..., , since any two total orderings of a finite set are order isomorphic . The least infinite ordinal is , which is identified with the cardinal number math aleph 0 math . However in the transfinite case ... than 2. The set of all countable ordinals constitutes the first uncountable ordinal first uncountable ordinal sub 1 sub , which is identified with the cardinal math aleph 1 math next cardinal ... more details
In linguistics, ordinal numbers are the words representing the rank of a number with respect to some order, in particular order or position i.e. first , second , third , etc. . Its use may refer to size, importance, chronology, etc. In English language English , they are adjective s. They are different from the Cardinal number linguistics cardinal numbers one , two , three , etc. referring to the quantity. Ordinal numbers are alternatively written in English with numerals and letter suffixes 1st, 2nd or 2d, 3rd or 3d, 4th, 11th, 21st, 101st, 477th, etc. In some countries, written dates omit the suffix, although it is nevertheless pronounced. For example 5 November 1605 pronounced the fifth of November ... November 5, 1605, November Fifth ... . When written out in full with of , however, the suffix is retained the 5th of November. In other languages, different ordinal indicator s are used to write ordinal numbers. In American Sign Language , the ordinal numbers first through ninth are formed ... for 6 10,000 and three hundredths for 0.03. See also Ordinalnumber for the related, but more formal and abstract, usage in mathematics Ordinal indicator for more conventions for writing ordinal numbers super scripting English numerals in particular the English numerals Ordinal numbers Ordinal numbers section References refs ling stub DEFAULTSORT OrdinalNumber Linguistics Category Numerals Category Naming conventions af Rangtelwoord cs adov slovka da Ordinaltal es N mero ordinal eo Numero ... simple Ordinalnumber ... 11 03 ref Variations Spatial or chronological ranks will use the standard linguistic ordinal numbers ... , etc . ref cite web url http verbmall.blogspot.com 2007 01 ordinal numbers revisited.html title Ordinal Numbers Revisited accessdate 2011 11 26 ref and historical rankings in literature, biology or music ... accessdate 2011 11 26 ref . The first twelve variations of ordinal numbers are given here. class wikitable ... more details
wiktionary ordinalOrdinal may refer to Ordinalnumber linguistics , a word representing the rank of a numberOrdinal scale , ranking things that are not necessarily numbers Ordinal indicator , the sign adjacent to a numeral denoting that it is an ordinalnumberOrdinalnumber in set theory, a number type with order structures Ordinal date , a simple form of expressing a date using only the year and the day number within that year Monarchical ordinal , used to distinguish monarchs and popes with the same regnal name In liturgy, an ordinal is a book that gives the Ordo Missae ordo ritual and rubrics for celebrations In Anglicanism , the Ordinal is the book containing the rites for the ordination of deacons and priests, and the consecration of bishops. Typically, this is printed with the Book of Common Prayer . In statistics, ordinal data is one level of measurement disambig de Ordinal gl Ordinal ... more details
Unreferenced date December 2009 In set theory , the successor of an ordinalnumber is the smallest ordinalnumber greater than . An ordinalnumber that is a successor is called a successor ordinal . Every ordinal other than 0 is either a successor ordinal or a limit ordinal . Using von Neumann s ordinal numbers the standard model of the ordinals used in set theory , the successor S of an ordinalnumber is given by the formula math S alpha alpha cup alpha . math Since the ordering on the ordinal numbers if and only if , it is immediate that there is no ordinalnumber between and S , and it is also clear that S . The successor operation can be used to define ordinal arithmetic ordinal addition rigorously via transfinite induction transfinite recursion as follows math alpha 0 alpha math math alpha S beta S alpha beta math and for a limit ordinal math alpha lambda bigcup beta lambda alpha beta math In particular, S 1. Multiplication and exponentiation are defined similarly. The successor points and zero are the isolated point s of the class of ordinal numbers, with respect to the order topology . See also ordinal arithmetic limit ordinal successor cardinal DEFAULTSORT Successor Ordinal Category Ordinal numbers cs Izolovan ordin l de Nachfolger Mathematik fr Ordinal successeur ko pl Nast pnik liczby porz dkowej sk Izolovan ordin l zh ... more details
In mathematics, the Veblen ordinal is either of two large countable ordinal s The small Veblen ordinal The large Veblen ordinal mathdab ... more details
In set theory , an ordinalnumber is an admissible ordinal if constructible universe L sub sub is an admissible set that is, a Inner model transitive model of Kripke Platek set theory in other words, is admissible when is a limit ordinal and L sub sub sub 0 sub collection. The first two admissible ordinals are and math omega 1 mathrm CK math the least recursive ordinal non recursive ordinal , also called the Church Kleene ordinal . Any regular cardinal regular uncountable cardinal is an admissible ordinal. By a theorem of Gerald Sacks Sacks , the countable set countable admissible ordinals are exactly those constructed in a manner similar to the Church Kleene ordinal, but for Turing machines with Oracle machine oracles . One sometimes writes math omega alpha mathrm CK math for the math alpha math th ordinal which is either admissible or a limit of admissibles an ordinal which 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 cardinal property large cardinals one can define recursively Mahlo cardinal s, for example . But all these ordinals are still countable. Therefore, admissible ordinals seem to be the recursive analogue of regular cardinal number s. Notice that is an admissible ordinal if and only if is a limit ordinal and there does not exist a for which there is a sub 1 sub L sub sub mapping from onto . If M is a standard model of KP, then the set of ordinals in M is an admissible ordinal. See also Large countable ordinals Inaccessible cardinal Constructible universe Category Ordinal numbers settheory stub unref date December 2007 ... more details
In mathematics , specifically set theory , an ordinalnumberordinal math alpha math is said to be recursive if there is a recursive set recursive binary relation math R math that well order s a subset of the natural numbers and the order type of that ordering is math alpha math . It is trivial to check that math omega math is recursive, the successor ordinal successor of a recursive ordinal is recursive, and the Set mathematics set of all recursive ordinals is closure mathematics closed downwards. We call the supremum of all recursive ordinals the Church Kleene ordinal and denote it by math omega CK 1 math . Since the recursive relations are parameter parameterized by the natural numbers, the recursive ordinals are also parameterized by the natural numbers. Therefore, there are only countable countably many recursive ordinals. Thus, math omega CK 1 math is countable. The recursive ordinals are exactly the ordinals that have an ordinal notation in Kleene s O Kleene s math mathcal O math . See also Arithmetical hierarchy Large countable ordinals Ordinal notation References Rogers, H. The Theory of Recursive Functions and Effective Computability , 1967. Reprinted 1987, MIT Press, ISBN 0 262 68052 1 paperback , ISBN 0 07 053522 1 Sacks, G. Higher Recursion Theory . Perspectives in mathematical logic, Springer Verlag, 1990. ISBN 0 387 19305 7 Category Set theory Category Computability theory Category Ordinal numbers settheory stub ... more details
A limit ordinal is an ordinalnumber which is neither zero nor a successor ordinal . Various equivalent ways to express this are It cannot be reached via the successor ordinalordinal successor operation S in precise terms, we say is a limit ordinal if and only if 0 and for any , there exists ... with a successor ordinal the set of ordinals below it has a maximum, so the supremum is this maximum, the previous ordinal. It is not zero and has no maximum element. It can be written in the form for 0. That is, in the Ordinal arithmetic Cantor normal form Cantor normal form there is no finite number as last term, and the ordinal is nonzero. It is a limit point of the class of ordinal numbers .... The next limit ordinal above the first is 2, and then we have n , for any natural number ... , every infinite cardinal number is also a limit ordinal and this is a fitting observation, as cardinal ... on whether or not 0 should be classified as a limit ordinal, as it does not have an immediate ... set theory class of ordinal numbers is well order ed, there is a smallest infinite limit ordinal denoted by . This ordinal is also the smallest infinite ordinal disregarding limit , as it is the least ... countable ordinals. However, there is no recursively enumerable scheme for ordinal notation systematically naming all ordinals less than the Church Kleene ordinal which is a countable ordinal. Beyond the countable, the first uncountable ordinal is usually denoted sub 1 sub . It is also a limit ordinal. Continuing, one can obtain the following all of which are now increasing in cardinality math ..., we always get a limit ordinal when taking the union of a set of ordinals that has no maximum element ... by simply showing that every infinite successor ordinal is equinumerous to a limit ordinal via the Hilbert ... of successorship and limit everything getting upgraded to a higher level . See also Ordinal arithmetic Limit cardinal Fundamental sequence ordinals References references DEFAULTSORT Limit Ordinal Category ... more details
In proof theory , ordinal analysis assigns ordinalnumber ordinals often large countable ordinals to mathematical ... used cut elimination to prove, in modern terms, that the proof theoretic ordinal of Peano arithmetic is epsilon zero &epsilon sub 0 sub . Definition Ordinal analysis concerns true, effective recursive theories that can interpret a sufficient portion of arithmetic to make statements about ordinal notations. The proof theoretic ordinal of such a theory math T math is the smallest recursive ordinal ... T math proves that math o math is an ordinal notation . Equivalently, it is the supremum ... R math on math omega math the set of natural numbers which well order s it with ordinal math alpha ... . The existence of any recursive ordinal which the theory fails to prove is well ordered follows ... proves to be ordinal notations is a math Sigma 0 1 math set see Hyperarithmetical theory . Thus the proof theoretic ordinal of a theory will always be a countable ordinal less than the Church Kleene ordinal math omega 1 mathrm CK math . In practice, the proof theoretic ordinal of a theory is a good measure of the strength of a theory. If theories have the same proof theoretic ordinal they are often equiconsistency equiconsistent , and if one theory has a larger proof theoretic ordinal than another ... ordinal sup 2 sup RFA, rudimentary function arithmetic . I sub 0 sub , arithmetic with induction ... theoretic ordinal sup 3 sup Friedman s grand conjecture suggests that much ordinary mathematics can be proved in weak systems having this as their proof theoretic ordinal. EFA, elementary function ... mathematics . Theories with proof theoretic ordinal sup n sup I sub 0 sub or EFA augmented by an axiom ... is total. Theories with proof theoretic ordinal sup sup RCA sub 0 sub , second order arithmetic ... with proof theoretic ordinal &epsilon sub 0 sub PA, Peano arithmetic Gentzen s consistency proof ... theoretic ordinal the Feferman Sch tte ordinal &Gamma sub 0 sub This ordinal is sometimes considered ... more details
number and is finite. br Otherwise, k 1 if is a multiple of sup sup 1 sup sup plus a finite number. br Otherwise, k 0. The notations can be used to name any ordinal less than &epsilon ... functions in a finite or transfinite number of variables give systems of ordinal notations for ordinals ... number represents an ordinal, or whether two numbers represent the same ordinal. However, one can effectively ...In mathematical logic and set theory , an ordinal notation is a finite sequence of symbols from a finite alphabet which names an ordinalnumber according to some scheme which gives meaning to the language. There are many such schemes of ordinal notations, including schemes by Wilhelm Ackermann , Heinz ... Pohlers, Kurt Sch tte , Gaisi Takeuti called ordinal diagrams , Oswald Veblen . Given such a scheme ... numbers by associating a natural number with each finite sequence of symbols via a G del numbering . Stephen Cole Kleene has a system of notations, called Kleene s O , which includes ordinal notations ... than each of its arguments, so that an ordinal is always being described in terms of smaller ordinals ... obvious next step would be to define a unary function, S , which takes an ordinal to the smallest ordinal ... allows one to name any natural number. The third function might be defined as one which maps each ordinal to the smallest ordinal which cannot yet be described with the above two functions and previous ... plus a finite number in which case one uses · 1 . The fourth function would map to sup sup · except when is a fixed point of that plus a finite number in which case one ... an infinite number of functions. So instead let us merge the unary functions together into a binary ... ordinal such that and and is not the value of for any smaller or for the same ... functions which enumerate epsilon numbers, then they will be able to name any ordinal less than the first epsilon number which cannot be named by the added functions. This last property, adding symbols ... more details
An ordinal date is a calendar date typically consisting of a year and a day of year ranging between 1 and 366 starting on January 1 , though year may sometimes be omitted. The two numbers can be formatted as YYYY DDD to comply with the ISO 8601 Ordinal dates ISO 8601 ordinal date format. Calculation Computation of the ordinal date within a year is part of calculating the ordinal date throughout the years from a Epoch reference date reference date , such as the Julian date . It is also part of calculating the day of the week , though for this purpose modulo 7 simplifications can be made. For these purposes it is convenient to count January and February as month 13 and 14 of the previous year, for two reasons the shortness of February and its variable length. In that case the date counted from 1 March is given by Floor function floor 30.6 m 1 d 122 which can also be written floor 30.6 m 91.4 d with m the month number and d the date. The formula reflects the fact that any five consecutive months in the range March January have a total length of 153 days, due to a fixed pattern 31 30 31 30 31 repeating itself some more than twice. Doomsday weekday Doomsday properties For m 2 n and d m we ... 5 9 and 9 5 , and also for n 3 difference between 7 11 and 11 7 . The ordinal date from 1 January is for January d for February d 31 for the other months the ordinal date from 1 March plus 59, or 60 in a leap year or equivalently, the ordinal date from 1 March of the previous year for which the formula ... the month number and d the date. This is the weekday relative to Doomsday. Table class wikitable style ... 151 181 212 243 273 304 334 Leap years 0 31 60 91 121 152 182 213 244 274 305 335 For example, the ordinal ... FOR CALENDAR DATE AND ORDINAL DATE FOR INFORMATION INTERCHANGE , Federal Information Processing ... watersna.com pdf julian calendar.pdf Perpetual Julian ordinal date chart browser needs to be able ... DEFAULTSORT Ordinal Date Category Calendars ... more details
, an ordinal indicator is a sign adjacent to a numeral denoting that it is an Ordinalnumber linguistics ordinalnumber , rather than a Names of numbers in English Cardinal numbers cardinal number ... , 3 e utg van third edition , but 6 november . Furthermore, suffixes can be left out if the number obviously is an ordinalnumber, example 3 utg. 3rd ed . Using a full stop as an ordinal indicator is considered ... edition of The Chicago Manual of Style states The letters in ordinal numbers should not appear ... some word processor s format ordinal indicators as superscripts by default. citation needed reason .... There is an important exception the teens ending with 11 through 19 use the th ordinal spoken or written ... depending on whether the number s grammatical gender is masculine or feminine respectively ... d as well. Some character set s provide characters specifically for use as ordinal indicators ... Latin 1 Punctuation code chart ref . The masculine ordinal indicator U 00BA is often confused ... Catalan The rule is to follow the number with the last letter in the singular and the last two letters .... Superscripting is nonstandard. Russian File Ordinal indicators in Russian before 1917 magnification .jpg thumb Example of ordinal indicator in Russian, 1913 One or two letters of the spelled out ... number of letters that include at least one consonant phoneme. Examples 2 IPA ft ro ... by its Head linguistics head noun which indicates the grammatical case of the ordinal , it is sufficient ..., I finished in 2nd place nowiki nowiki . However, if the head noun is omitted, the ordinal ... nowiki . The system becomes rather complicated when the ordinal needs to be inflected , as the ordinal ... to exactly identify the ordinal suffix, as its borders with the word stem and the case ending may appear blurred. In such cases it may be preferable to write the ordinal as a word i.e., entirely ... that aren t related to ordinal numbers the letters o and a may be among those used, but they don t indicate ... more details
math in the latter. Cantor normal form This section is linked from OrdinalnumberOrdinal numbers present a rich arithmetic. Every ordinalnumber can be uniquely written as math omega beta 1 c 1 omega ... equal to 1 and allow the exponents to be equal. In other words, every ordinalnumber can be uniquely ...In the mathematical field of set theory , ordinal arithmetic describes the three usual operations on ordinalnumber s addition, multiplication, and exponentiation. Each can be defined in essentially two ... ordered. The order type of that union is the ordinal which results from adding the order types ... transfinite ordinal is , the set of all natural numbers. Let s try to visualize the ordinal ... 1 here, 1 denotes the successor of an ordinal , and if is a limit ordinal then is the limit of the for all < . Using this definition, we also see that 3 is a successor ordinal it is the successor ... alpha gamma le beta gamma math Ordinal addition is left cancellative if , then . Furthemore ... product is the ordinal which results from multiplying the order types of S and T . Again, this operation ... 2 2. Hence multiplication of ordinals is not commutative. Distributivity partially holds for ordinal ... 1 1 2 while 1 1 which is different. Therefore, the ordinal numbers do not form a ring ... domain , since they are not even a ring, and the Euclidean norm is ordinal valued. Right division ... multiplication. For instance, sup 2 sup using the operation of ordinal multiplication. To generalize this to the case when the exponent is an infinite ordinal requires a different viewpoint ... number of elements of the sequence are different from zero. This is naturally motivated as the limit ... a finite number of elements of the domain E map to an element larger than the least element ... B sup E sup is the ordinal which results from applying ordinal exponentiation to the order type of the base ... of ordinal exponentiation sup 0 sup 1. If 0 , then 0 sup sup 0. 1 sup sup 1. sup 1 sup ... more details
Ordinal utility Economic theory theory states that while the utility of a particular good economics good or service cannot be measured using a numerical scale bearing economic meaning in and of itself, pairs of alternative bundles combinations of goods can be ordered such that one is considered by an individual to be worse than, equal to, or better than the other. This contrasts with cardinal utility theory, which generally treats utility as something whose numerical value is meaningful in its own right. Indifference curve mappings When a large number of bundles of goods are compared, the preferences of the individual can be seen. This information is usually put together on a graph called an indifference map. One of these is shown below image Simple indifference curves.svg 200px indifference map Each indifference curve is a set of points, each representing a combination of quantities of two goods or services, all of which combinations the consumer is equally satisfied with. The further a curve is from the origin, the greater is the level of utility. The slope of the curve the negative of the marginal rate of substitution of X for Y at any point shows the rate at which the individual is willing to trade off good X against good Y maintaining the same level of utility. The curve is convex to the origin as shown assuming the consumer has a diminishing marginal rate of substitution. It can be shown that consumer analysis with indifference curves an ordinal approach gives the same results as that based on cardinal utility theory i.e., consumers will consume at the point where the marginal ... to observe ordinal preference relations in the real world. The challenge of revealed preference ... botond mistakeschicago.pdf ref Ordinal utility functions An ordinal utility function describing ... mappings. Thus in ordinal utility theory, there is no concept of diminishing marginal utility , which ... references External Links Ordinal utility vs. Cardinal utility Murray N. Rothbard , http mises.org ... more details
In mathematics , ordinal logic is a logic associated with an ordinalnumber by recursively adding elements to a sequence of previous logics. ref name feferman Solomon Feferman, Turing in the Land of O z in The universal Turing machine a half century survey by Rolf Herken 1995 ISBN 3211826378 page 111 ref ref Concise Routledge encyclopedia of philosophy 2000 ISBN 0415223644 page 647 ref The concept was introduced in 1938 by Alan Turing in his PhD dissertation at Princeton in view of G del s incompleteness theorems . ref name alan Alan Turing, Systems of Logic Based on Ordinals Proceedings London Mathematical Society Volumes 2 45, Issue 1, pp. 161 228. http plms.oxfordjournals.org content s2 45 1 161.extract ref ref name feferman While G del showed that every system of logic suffers from some form of incompleteness, Turing focused on a method so that from a given system of logic a more complete system may be constructed. By repeating the process a sequence L1, L2, of logics is obtained, each more complete than the previous one. A logic L can then be constructed in which the provable theorems are the totality of theorems provable with the help of the L1, L2, etc. Thus Turing showed how one can associate a logic with any constructive ordinal . ref name alan References Reflist Category Mathematical logic Category Systems of formal logic mathlogic stub ... more details
Refimprove date April 2008 Ordinal numbers or regnal numbers are used to distinguish among persons with the same name who held the same office. Most importantly, they are used to distinguish monarch s. An ordinal is the number placed after a monarch s regnal name to differentiate between a number of kings .... In any case, it is usual to count only the monarchs or heads of the family, and to number them sequentially ... Swedish monarchs , the ordinal qualifies only the first name for example, Carl XVI Gustaf of Sweden ... ordinal have been rarities. As a rule of thumb, medieval European monarchs did not use ordinals ... used that ordinal. Presumably, use of the ordinal of king Frederick III of Sicily also is contemporaneous ... is James II of England James VII and II . Mary II of England Mary II s ordinal relates to both Queen ... s regnal number was occasionally omitted in Scotland, even by the established Church of Scotland , in deference ... ref So, theoretically, any future British King Edward would be given the number IX, even though ... be given the number IV, even though he would be the first Robert to reign in England. Many residents ... not to use an ordinal when there has been only one holder of that name. For example, Queen ... Louise Hippolyte, who reigned 150 years earlier, doesn t appear to have used an ordinal . It was also ... John Paul I . The ordinal for King Juan Carlos I of Spain is used in both Spanish language Spanish and English ... of The First ordinal started with Paul I of Russia Paul I . Before him, neither Anna of Russia nor Elizabeth of Russia had the I ordinal. The use of The First ordinal is also common to self proclaimed ... they pretend to introduce. Pretenders It is traditional amongst monarchists to continue to number ... consorts. So whereas King George V of the United Kingdom used an ordinal to distinguish him from other kings in the United Kingdoms called George, his wife, Queen Mary of Teck Mary , had no ordinal. The lack of an ordinal in the case of royal consorts complicates the recording of history, as there may ... more details
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 sub 0 sub . Most systems of notation use symbols such as , , sub sub , some of which are modifications of the Veblen function s to produce countable ordinals even for uncountable arguments, and some of which are collapsing function s . The smaller Ackermann ordinal is the limit of a system of ordinal notations invented by harvtxt Ackermann 1951 , and is sometimes denoted by math phi Omega 2 0 math or math theta Omega 2 math or math psi Omega 2 math . Ackermann s system of notation is weaker than the system introduced much earlier by harvtxt Veblen 1908 , which he seems to have been unaware of. References citation mr 0039669 last Ackermann first Wilhelm title Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse journal Math. Z. volume 53 year 1951 pages 403 413 doi 10.1007 BF01175640 issue 5 citation title Continuous Increasing Functions of Finite and Transfinite Ordinals first Oswald last Veblen journal Transactions of the American Mathematical Society volume 9 issue 3 year 1908 pages 280 292 doi 10.2307 1988605 citation last Weaver first Nik arxiv math 0509244 title Predicativity beyond Gamma 0 year 2005 countable ordinals DEFAULTSORT Ackermann Ordinal Category Ordinal numbers ... more details
In mathematical optimization , ordinal optimization is the maximization of functions taking values in a partially ordered set poset . Ordinal optimization has applications in the theory of queuing theory queuing flow network networks . Mathematical foundations See also Mathematical optimization Partially ordered set Lattice Greedoid Antimatroid Combinatorial optimization Duality mathematics Order reversing dualities Ordinal optimization is the maximization of function taking values in a partially ordered set poset or, duality mathematics Order reversing dualities dually , the minimization of functions taking values in a poset. ref Dietrich, B. L. Hoffman, A. J. On greedy algorithms, partially ordered sets, and submodular functions. IBM J. Res. Develop. 47 2003 , no. 1, 25 30. MR1957350 2003k 90102 ref ref Topkis, Donald M. Supermodularity and complementarity . Frontiers of Economic Research. Princeton University Press, Princeton, NJ, 1998. xii 272 pp. ISBN 0 691 03244 0 MR1614637 99i 90024 ref ref Singer, Ivan Abstract convex analysis . Canadian Mathematical Society Series of Monographs and Advanced Texts. A Wiley Interscience Publication. John Wiley & Sons, Inc., New York, 1997. xxii ... in mathematics include The real number s ordered by the standard less than or equal relation a totally ... that are greater than 1, then the resulting poset does not have a least element, but any prime number ... River Edge, NJ, 2002 pages xx 367 isbn 981 238 067 1 mr 1921556 ref Ordinal optimization in computer science and statistics See also Selection algorithm Problems of ordinal optimization arise in many ... Discrete event simulation Since the 1960s, the field of ordinal optimization has expanded in theory ... theory Heuristic computer science Heuristics Level of measurement Ordinal data References reflist ... Ho Ho, Y.C. , Sreenivas, R., Vakili, P., Ordinal Optimization of Discrete Event Dynamic Systems , J ... on ordinal optimization by Yu Chi Ho DEFAULTSORT Ordinal Optimization Category Mathematical optimization ... more details
In mathematics , the first uncountable ordinal , traditionally denoted by sub 1 sub or sometimes by , is the smallest ordinalnumber that, considered as a set mathematics set , is uncountable . It is the supremum of all countable ordinals. The elements of sub 1 sub are the countable ordinals, of which there are uncountably many. Like any ordinalnumber in von Neumann s approach , sub 1 sub is a well order well ordered set , with set membership &isin serving as the order relation. sub 1 sub is a limit ordinal , i.e. there is no ordinal with 1 sub 1 sub . The cardinality of the set sub 1 sub is the first uncountable cardinal number , sub 1 sub Aleph number Aleph one aleph one . The ordinal sub 1 sub is thus the Ordinalnumber Initial ordinal of a cardinal initial ordinal of sub 1 sub . Indeed, in most constructions sub 1 sub and sub 1 sub are equal as sets. To generalize if is an arbitrary ordinal we define sub sub as the initial ordinal of the cardinal sub sub . The existence of sub 1 sub can be proven without the axiom of choice . See Hartogs number . Topological properties Any ordinalnumber can be turned into a topological space by using the order topology . When viewed as a topological space, sub 1 sub is often written as 0, sub 1 sub to emphasize that it is the space consisting of all ordinals smaller than sub 1 sub . Every sequence increasing &omega sequence of elements of 0, sub 1 sub converges to a Limit of a sequence limit in 0, sub 1 sub . The reason is that the union set theory union supremum of every countable set of countable ordinals is another countable ordinal. The topological space 0, sub ... . See also Ordinal arithmetic Large countable ordinal Continuum hypothesis Reference Thomas ... . Category Ordinal numbers Category Topological spaces es Primer ordinal no numerable fr Premier ordinal non d nombrable ... more details
no footnotes date August 2011 In mathematics, the Bachmann Howard ordinal or Howard ordinal is a large countable ordinal . It is the ordinal analysis proof theoretic ordinal of several mathematical theories, such as Kripke Platek set theory with the axiom of infinity and the system CZF of constructive set theory . It is named after William Alvin Howard and Heinz Bachmann . Definition The Bachmann Howard ordinal is defined using an ordinal collapsing function with more details given in the relevant article sub sub enumerates the epsilon nought epsilon numbers , the ordinals such that sup sup . sub 1 sub is the first uncountable ordinal . sub 1 sub is the first epsilon number after sub sub . 0 is defined to be the smallest ordinal that cannot be constructed by starting with 0, 1, and , and repeatedly applying ordinal addition, multiplication and exponentiation. is defined in the same way, except that it also allows applications of to previously constructed ordinals less than . The Bachmann Howard ordinal is sub 1 sub . The Bachmann Howard ordinal can also be defined as math phi varepsilon Omega 1 0 math for an extension of the Veblen function s sub sub to uncountable this extension is not completely straightforward. References citation mr 0036806 last Bachmann first Heinz title Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordnungszahlen journal Vierteljschr. Naturforsch. Ges. Z rich volume 95 year 1950 pages 115 147 citation mr 0329869 last Howard first W. A. title A system of abstract constructive ordinals. journal J. Symbolic Logic volume 37 year 1972 pages 355 374 issue 2 doi 10.2307 2272979 jstor 2272979 publisher Association for Symbolic Logic citation last Pohlers first Wolfram title Proof theory mr 1026933 series Lecture Notes in Mathematics volume 1407 publisher Springer Verlag place Berlin year ... Category Ordinal numbers ... more details
In mathematics, the Church Kleene ordinal , math omega mathrm CK 1 math , is a large countable ordinal . It is the smallest non recursive ordinal . It is named after Alonzo Church and S. C. Kleene . References Citation last1 Church first1 Alonzo author1 link Alonzo Church last2 Kleene first2 S. C. author2 link Stephen Cole Kleene title Formal definitions in the theory of ordinal numbers. jfm 63.0029.02 year 1937 journal Fundamenta mathematicae, Warszawa, volume 28 pages 11 21 citation last Church url http www.ams.org bull 1938 44 04 S0002 9904 1938 06720 1 title The constructive second number class journal Bull. Amer. Math. Soc. volume 44 year 1938 pages 224 232 doi 10.1090 S0002 9904 1938 06720 1 first1 Alonzo issue 4 citation title On Notation for Ordinal Numbers first S. C. last Kleene journal The Journal of Symbolic Logic volume 3 issue 4 year 1938 pages 150 155 doi 10.2307 2267778 publisher The Journal of Symbolic Logic, Vol. 3, No. 4 jstor 2267778 Citation last1 Rogers first1 Hartley title The Theory of Recursive Functions and Effective Computability origyear 1967 publisher First MIT press paperback edition isbn 978 0 262 68052 3 year 1987 countable ordinals Category Proof theory Category Ordinal numbers settheory stub ... more details
main Ordinalnumber In the mathematical discipline of set theory , there are many ways of describing specific countable set countable ordinalnumber ordinals . The smallest ones can be usefully and non ... to proof theory still have computable function computable ordinal notation s. However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not for reasons ..., all ordinals with notations are exhausted well below the first uncountable ordinal first uncountable ordinal sub 1 sub their supremum is called Church Kleene sub 1 sub or sub 1 sub sup CK sup not to be confused with the first uncountable ordinal, sub 1 sub , described The Church Kleene ordinal below . Ordinal numbers below sub 1 sub sup CK sup are the recursive ordinals see Generalities ... not have notations. Due to the focus on countable ordinals, ordinal arithmetic is used throughout ... on recursive ordinals Main Recursive ordinalOrdinal notations Main Ordinal notation Recursive ordinal s or computable ordinals are certain countable ordinals loosely speaking those represented ... that a computable ordinal is the order type of some recursive i.e., computable well ordering of the natural numbers so, essentially, an ordinal is recursive when we can present the set of smaller ordinals ... them . Consider the following as a sort of stub for a yet to be written article on ordinal notations ... A different definition uses Stephen Cole Kleene Kleene s system of ordinal notation s. Briefly, an ordinal notation is either the name zero describing the ordinal 0 , or the successor of an ordinal notation describing the successor of the ordinal described by that notation , or a Turing machine computable function that produces an increasing sequence of ordinal notations that describe the ordinal that is the limit of the sequence , and ordinal notations are partially ordered so as to make ... is computable however, the set O of ordinal notations itself is highly non recursive, owing ... more details
In mathematical set theory , a set S is said to be ordinal definable if, informally, it can be defined in terms of a finite number of ordinalnumber ordinals by a first order formula. Ordinal definable sets were introduced by harvtxt G del 1965 . A drawback to this informal definition is that requires quantification over all first order formulas, which cannot be formalized in the language of set theory. However there is a different way of stating the definition which can be so formalized. In this approach, a set S is formally defined to be ordinal definable if there is some collection of ordinals sub 1 sub ... sub n sub such that math S isin V alpha 1 math and math S math can be defined as an element of math V alpha 1 math by a first order formula taking sub 2 sub ... sub n sub as parameters. Here math V alpha 1 math denotes the set indexed by the ordinal sub 1 sub in the Von Neumann universe von Neumann hierarchy of sets . In other words, S is the unique object such that S , sub 2 sub ... sub n sub holds with its quantifiers ranging over math V alpha 1 math . The proper class class of all ordinal definable sets is denoted OD it is not necessarily transitive set transitive , and need not be a model of ZFC because it might not satisfy the axiom of extensionality . A set is hereditarily ordinal definable if it is ordinal definable and all elements of its transitive set transitive closure are ordinal definable. The class of hereditarily ordinal definable sets is denoted by HOD, and is a transitive model of ZFC, with a definable well ordering. It is consistent with the axioms of set theory that all sets are ordinal definable, and so hereditarily ordinal definable. The assertion that this situation holds is referred to as V OD or V HOD. It follows from V L , and is equivalent to the existence of a definable well order well ordering of the universe. Note however that the formula expressing V HOD need not hold true within HOD, as it is not Absoluteness absolute ... more details
In set theory , a branch of mathematics , an additively indecomposable ordinal &alpha is any ordinalnumber that is not 0 such that for any math beta, gamma alpha math , we have math beta gamma alpha. math The set of additively indecomposable ordinals is denoted math mathbb H . math From the continuity of addition in its right argument, we get that if math beta alpha math and &alpha is additively indecomposable, then math beta alpha alpha. math Obviously math 1 in mathbb H math , since math 0 0 1. math No finite set finite ordinal other than math 1 math is in math mathbb H . math Also, math omega in mathbb H math , since the sum of two finite ordinals is still finite. More generally, every infinite set infinite cardinal number cardinal is in math mathbb H . math math mathbb H math is closed and unbounded, so the enumerating function of math mathbb H math is normal. In fact, math f mathbb H alpha omega alpha. math The derivative math f mathbb H prime alpha math which enumerates fixed points of f sub H sub is written math epsilon alpha. math Ordinals of this form that is, fixed point mathematics fixed point s of math f mathbb H math are called epsilon nought epsilon numbers . The number math epsilon 0 omega omega omega cdot cdot cdot math is therefore the first fixed point of the sequence math omega, omega omega , omega omega omega , ldots math Multiplicatively indecomposable A similar notion can be defined for multiplication. The multiplicatively indecomposable ordinals are those of the form math omega omega alpha , math for any ordinal &alpha . See also Ordinal arithmetic planetmath id 4056 title Additively indecomposable settheory stub Category Ordinal numbers ... more details
Unreferenced auto yes date December 2009 Orphan date February 2009 Merge to Enumerated type date July 2010 In computer programming , an ordinal data type is a data type with the property that its values can be counted. That is, the values can be put in a one to one correspondence with the positive integer s. For example, Character computer science characters are ordinal because we can call A the first character, B the second, etc. The term is often used in programming for variables that can take one of a wiktionary Finite finite often small number of values. While the values are often implemented as integers or similar types such as bytes they are assigned Literal computer science literal names and the programming language and the compiler for that language can enforce that variables only be assigned those literals. For instance in Pascal, one can define source lang pascal var x 1..10 y a .. z source DEFAULTSORT Ordinal Data Type Category Data types Compu prog stub pl Typ porz dkowy ... more details
Encyclopedia
top
