Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Well-quasi-ordering
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== {{Reflist| refs= <ref name="forster"> {{cite journal | last = Forster | first = Thomas | authorlink = Thomas Forster (mathematician)| title= Better-quasi-orderings and coinduction | journal = Theoretical Computer Science | year = 2003 | volume = 309 | pages= 111–123 | doi= 10.1016/S0304-3975(03)00131-2 | issue = 1–3| doi-access = }}</ref> }} * {{cite journal | last = Dickson | first = L. E. | authorlink = Leonard Dickson | title=Finiteness of the odd perfect and primitive abundant numbers with ''r'' distinct prime factors | journal=[[American Journal of Mathematics]] | year = 1913 | volume = 35 | pages=413–422 | doi=10.2307/2370405 | jstor = 2370405 | issue = 4 }} * {{cite journal | last = Higman | first = G. |authorlink = Graham Higman | title=Ordering by divisibility in abstract algebras | journal=Proceedings of the London Mathematical Society | year=1952 | volume=2 | pages=326–336 | doi=10.1112/plms/s3-2.1.326}} * {{cite journal | authorlink = Joseph Kruskal | last=Kruskal |first= J. B. | title=The theory of well-quasi-ordering: A frequently discovered concept | journal=[[Journal of Combinatorial Theory]] | series = Series A | year=1972 | volume=13 | pages=297–305 | doi=10.1016/0097-3165(72)90063-5 | issue = 3| doi-access=free }} * {{cite journal | last = Ketonen | first = Jussi | title = The structure of countable Boolean algebras | journal = [[Annals of Mathematics]] | volume = 108 | pages = 41β89 | year = 1978 | doi = 10.2307/1970929 | jstor = 1970929 | issue = 1}} * {{cite book | last=Milner | first = E. C. | authorlink = Eric Charles Milner | year=1985 | chapter = Basic WQO- and BQO-theory | editor-first=I.|editor-last=Rival|editor-link=Ivan Rival | title = Graphs and Order. The Role of Graphs in the Theory of Ordered Sets and Its Applications | pages=487–502 | publisher=D. Reidel Publishing Co. | isbn=90-277-1943-8}} * {{cite journal | last = Gallier | first = Jean H. |authorlink= Jean Gallier | title= What's so special about Kruskal's theorem and the ordinal Ξo? A survey of some results in proof theory | journal = Annals of Pure and Applied Logic | year = 1991 | volume = 53 | pages= 199β260 | doi= 10.1016/0168-0072(91)90022-E | issue = 3| doi-access = }} {{Order theory}} [[Category:Order theory]] [[Category:Wellfoundedness]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)