Search results
Results from the WOW.Com Content Network
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.
For example, the ordinal 42 is generally identified as the set {0, 1, 2, ..., 41}. Conversely, any set S of ordinals that is downward closed — meaning that for any ordinal α in S and any ordinal β < α, β is also in S — is (or can be identified with) an ordinal. This definition of ordinals in terms of sets allows for infinite ordinals.
In written languages, an ordinal indicator is a character, or group of characters, following a numeral denoting that it is an ordinal number, rather than a cardinal number. Historically these letters were "elevated terminals", that is to say the last few letters of the full word denoting the ordinal form of the number displayed as a superscript .
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 .
The cardinality of any infinite ordinal number is an aleph number. Every aleph is the cardinality of some ordinal. The least of these is its initial ordinal. Any set whose cardinality is an aleph is equinumerous with an ordinal and is thus well-orderable. Each finite set is well-orderable, but does not have an aleph as its cardinality.
In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength.If theories have the same proof-theoretic ordinal they are often equiconsistent, and if one theory has a larger proof-theoretic ordinal than another it can often prove the consistency of the second theory.
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Every well-ordered set is order-equivalent to exactly one ordinal number, by definition. The ordinal numbers are taken to be the canonical representatives of their classes, and so the order type of a well-ordered set is usually identified with the corresponding ordinal. Order types thus often take the form of arithmetic expressions of ordinals.