Partially ordered set (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Partially ordered set" in English language version.

Last modified: 07:57:56, 21 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

74books.google.com

3^rd place

22archive.org

6^th place

11dml.cz

low place

11web.archive.org

1^st place

11leanprover.github.io

low place

11umich.edu

429^th place

307^th place

11libretexts.org

4,683^rd place

3,565^th place

11stanford.edu

194^th place

182^nd place

11lsu.edu

2,856^th place

1,830^th place

11hal.science

2,005^th place

1,689^th place

11doi.org

2^nd place

11hdl.handle.net

66^th place

34^th place

archive.org (Global: 6^th place; English: 6^th place)

Merrifield, Richard E.; Simmons, Howard E. (1989). Topological Methods in Chemistry. New York: John Wiley & Sons. pp. 28. ISBN 0-471-83817-9. Retrieved 27 July 2012. A partially ordered set is conveniently represented by a Hasse diagram...
P. R. Halmos (1974). Naive Set Theory. Springer. p. 82. ISBN 978-1-4757-1645-0.

books.google.com (Global: 3^rd place; English: 3^rd place)

Wallis, W. D. (14 March 2013). A Beginner's Guide to Discrete Mathematics. Springer Science & Business Media. p. 100. ISBN 978-1-4757-3826-1.
Simovici, Dan A. & Djeraba, Chabane (2008). "Partially Ordered Sets". Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics. Springer. ISBN 9781848002012.
Davey & Priestley (2002), pp. 14–15. Davey, B. A.; Priestley, H. A. (2002). Introduction to Lattices and Order (2nd ed.). New York: Cambridge University Press. ISBN 978-0-521-78451-1.
Davey & Priestley (2002), pp. 17–18. Davey, B. A.; Priestley, H. A. (2002). Introduction to Lattices and Order (2nd ed.). New York: Cambridge University Press. ISBN 978-0-521-78451-1.

dml.cz (Global: low place; English: low place)

Flaška, V.; Ježek, J.; Kepka, T.; Kortelainen, J. (2007). "Transitive Closures of Binary Relations I". Acta Universitatis Carolinae. Mathematica et Physica. 48 (1). Prague: School of Mathematics – Physics Charles University: 55–69. Lemma 1.1 (iv). This source refers to asymmetric relations as "strictly antisymmetric".

doi.org (Global: 2^nd place; English: 2^nd place)

Ward, L. E. Jr (1954). "Partially Ordered Topological Spaces". Proceedings of the American Mathematical Society. 5 (1): 144–161. doi:10.1090/S0002-9939-1954-0063016-5. hdl:10338.dmlcz/101379.

hal.science (Global: 2,005^th place; English: 1,689^th place)

Prevosto, Virgile; Jaume, Mathieu (11 September 2003). Making proofs in a hierarchy of mathematical structures. CALCULEMUS-2003 – 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning. Roma, Italy: Aracne. pp. 89–100.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Ward, L. E. Jr (1954). "Partially Ordered Topological Spaces". Proceedings of the American Mathematical Society. 5 (1): 144–161. doi:10.1090/S0002-9939-1954-0063016-5. hdl:10338.dmlcz/101379.

leanprover.github.io (Global: low place; English: low place)

Avigad, Jeremy; Lewis, Robert Y.; van Doorn, Floris (29 March 2021). "13.2. More on Orderings". Logic and Proof (Release 3.18.4 ed.). Archived from the original on 3 April 2023. Retrieved 24 July 2021. So we can think of every partial order as really being a pair, consisting of a weak partial order and an associated strict one.

libretexts.org (Global: 4,683^rd place; English: 3,565^th place)

math.libretexts.org

Kwong, Harris (25 April 2018). "7.4: Partial and Total Ordering". A Spiral Workbook for Discrete Mathematics. Retrieved 23 July 2021.

lsu.edu (Global: 2,856^th place; English: 1,830^th place)

math.lsu.edu

Chen, Peter; Ding, Guoli; Seiden, Steve. On Poset Merging (PDF) (Technical report). p. 2. Retrieved 5 January 2022. A comparison between two elements s, t in S returns one of three distinct values, namely s≤t, s>t or s|t.

stanford.edu (Global: 194^th place; English: 182^nd place)

match.stanford.edu

"Finite posets". Sage 9.2.beta2 Reference Manual: Combinatorics. Retrieved 5 January 2022. compare_elements(x, y): Compare x and y in the poset. If x < y, return −1. If x = y, return 0. If x > y, return 1. If x and y are not comparable, return None.

umich.edu (Global: 429^th place; English: 307^th place)

eecs.umich.edu

Rounds, William C. (7 March 2002). "Lectures slides" (PDF). EECS 203: DISCRETE MATHEMATICS. Retrieved 23 July 2021.

web.archive.org (Global: 1^st place; English: 1^st place)

Avigad, Jeremy; Lewis, Robert Y.; van Doorn, Floris (29 March 2021). "13.2. More on Orderings". Logic and Proof (Release 3.18.4 ed.). Archived from the original on 3 April 2023. Retrieved 24 July 2021. So we can think of every partial order as really being a pair, consisting of a weak partial order and an associated strict one.

Partially ordered set (English Wikipedia)

archive.org (Global: 6th place; English: 6th place)

books.google.com (Global: 3rd place; English: 3rd place)

dml.cz (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

hal.science (Global: 2,005th place; English: 1,689th place)

hdl.handle.net (Global: 66th place; English: 34th place)