Alphabetical order

DOI10.1305/NDJFL/1093637871MaRDI QIDQ1105624zbMATH OpenOpenAlexFDO

Authors George Boolos

Publication date 1988

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093637871

zbMATH Keywords

lexicographical orderorder type

Mathematics Subject Classification ID

Ordinal and cardinal numbers (03E10) Total orders (06A05) Partial orders, general (06A06)

Review text

Let \(\xi\) be an ordinal with \(2\leq \xi <\omega_ 1\), and let \(\xi^*\) be the set of all finite sequences of members of \(\xi\) with the lexicographical order (in this paper it is called alphabetical order). The author shows the nondifficult result that \(\xi^*\) has the order type \(\omega (1+\eta)\).

Recommendations

• \(\alpha\)-words and the radix order
• Algorithms for producing and ordering lexical and nonlexical sequences out of one element
• scientific article; zbMATH DE number 4150233
• scientific article; zbMATH DE number 4072951
• Density of the Lexicographically Ordered Space {0, 1} α

Cited in

(3)

• Density of the Lexicographically Ordered Space {0, 1} α
• scientific article; zbMATH DE number 3957177 (Why is no real title available?)
• Algorithms for producing and ordering lexical and nonlexical sequences out of one element

This page was built for publication: Alphabetical order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105624)