Keyword

well-ordering

Description: A total order in which every nonempty subset has a least element, studied in mathematical logic, set theory, and type theory.
Wikidata ID: wiki/Q659746
OpenAlex ID: keywords/well-ordering
1994 · William Adams, Philippe Loustaunau · Graduate studies in mathematics · 1,203
1960 · Paul R. Halmos · 936
2002 · Emmanuele DiBenedetto · Birkhäuser Boston eBooks · 259
1976 · James E. Baumgartner · Annals of Mathematical Logic · 118
1954 · R. Rado · Mathematika · 104
1989 · Lauri Hella · Annals of Pure and Applied Logic · 92
1974 · Wayne Richter, Peter Aczel · Studies in logic and the foundations of mathematics · 92
2014 · CAROL R. KARP · Elsevier eBooks · 88
1997 · Choice Reviews Online · 87
1983 · Rohit Parikh · Annual Symposium on Foundations of Computer Science · 83
2002 · Patrick Dehornoy, Ivan Dynnikov, et al. · 82
1950 · J. Barkley Rosser, Hao Wang · Journal of Symbolic Logic · 69
1939 · Alfred Tarski · Fundamenta Mathematicae · 66
2020 · Diana Schmidt · Trends in logic · 65
1966 · E. Lopez-Escobar · Fundamenta Mathematicae · 65
2011 · Alberto Marcone, Antonio Montalbán · Journal of Symbolic Logic · 59
1978 · Saharon Shelah · Annals of Mathematical Logic · 56
1984 · Peter C Fishburn · Journal of Economic Theory · 54
1976 · Harvey Friedman · Journal of Symbolic Logic · 53
2015 · Sean Eberhard · Bulletin of the London Mathematical Society · 52
1954 · Werner Markwald · Mathematische Annalen · 46
1967 · E. Wolk · Fundamenta Mathematicae · 45
1905 · Felix Bernstein · Mathematische Annalen · 45
1996 · Richard Laver · Journal of Pure and Applied Algebra · 43
Works count: 560
Citation count: 6,282
Year
Topic
Type