Partially ordered set (English Wikipedia)

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

refsWebsite

Global rank English rank

4books.google.com

3^rd place

3^rd place

6^th place

6^th place

low place

low place

1leanprover.github.io

low place

low place

459^th place

360^th place

1libretexts.org

3,627^th place

2,467^th place

179^th place

183^rd place

3,324^th place

2,257^th place

low place

low place

2^nd place

2^nd place

102^nd place

76^th place

archive.org

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

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

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

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

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.

handle.net

hdl.handle.net

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

Avigad, Jeremy; Lewis, Robert Y.; van Doorn, Floris (29 March 2021). "13.2. More on Orderings". Logic and Proof (Release 3.18.4 ed.). 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

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

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

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

eecs.umich.edu

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