About Quotient Orders and Ordering Sequences

About Quotient Orders and Ordering Sequences

Formalized Mathematics

Volume 25 (2017): Issue 2 (July 2017)

By:

Sebastian Koch

Open Access

|Sep 2017

References

[1] Grzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(<bold>3</bold>):563–567, 1990.
Search in Google Scholar Back to article
[2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(<bold>1</bold>):41–46, 1990.
Search in Google Scholar Back to article
[3] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(<bold>1</bold>):107–114, 1990.
Search in Google Scholar Back to article
[4] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi: <a href="https://doi.org/10.1007/978-3-319-20615-817." target="_blank" rel="noopener noreferrer" class="text-signal-blue hover:underline">10.1007/978-3-319-20615-817.</a><pub-id pub-id-type="doi"><a href="https://doi.org/10.1007/978-3-319-20615-817" target="_blank" rel="noopener noreferrer" class="text-signal-blue hover:underline">10.1007/978-3-319-20615-817</a></pub-id>
Open DOI Search in Google Scholar Back to article
[5] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(<bold>3</bold>):529–536, 1990.
Search in Google Scholar Back to article
[6] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(<bold>1</bold>): 55–65, 1990.
Search in Google Scholar Back to article
[7] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(<bold>1</bold>):153–164, 1990.
Search in Google Scholar Back to article
[8] Czesław Byliński. Partial functions. Formalized Mathematics, 1(<bold>2</bold>):357–367, 1990.
Search in Google Scholar Back to article
[9] Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(<bold>1</bold>):47–53, 1990.
Search in Google Scholar Back to article
[10] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to algorithms. MIT Press, 3. ed. edition, 2009. ISBN 0-262-53305-7, 978-0-262-53305-8, 978-0-262-03384-8. <ext-link ext-link-type="uri" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://scans.hebis.de/HEBCGI/show.pl?21502893_toc.pdf">http://scans.hebis.de/HEBCGI/show.pl?21502893_toc.pdf</ext-link>.
Search in Google Scholar Back to article
[11] Agata Darmochwał. Finite sets. Formalized Mathematics, 1(<bold>1</bold>):165–167, 1990.
Search in Google Scholar Back to article
[12] Jarosław Kotowicz. Partial functions from a domain to the set of real numbers. Formalized Mathematics, 1(<bold>4</bold>):703–709, 1990.
Search in Google Scholar Back to article
[13] Gilbert Lee and Piotr Rudnicki. Dickson’s lemma. Formalized Mathematics, 10(<bold>1</bold>):29–37, 2002.
Search in Google Scholar Back to article
[14] Michael Maschler, Eilon Solan, and Shmuel Zamir. Game theory. Cambridge Univ. Press, 2013. ISBN 978-1-107-00548-8. doi: <a href="https://doi.org/10.1017/CBO9780511794216." target="_blank" rel="noopener noreferrer" class="text-signal-blue hover:underline">10.1017/CBO9780511794216.</a><dgdoi:pub-id xmlns:dgdoi="http://degruyter.com/resources/doi-from-crossref" pub-id-type="doi"><a href="https://doi.org/10.1017/CBO9780511794216" target="_blank" rel="noopener noreferrer" class="text-signal-blue hover:underline">10.1017/CBO9780511794216</a></dgdoi:pub-id>
Search in Google Scholar Back to article
[15] Takashi Mitsuishi, Katsumi Wasaki, and Yasunari Shidama. Property of complex functions. Formalized Mathematics, 9(<bold>1</bold>):179–184, 2001.
Search in Google Scholar Back to article
[16] Yatsuka Nakamura. Sorting operators for finite sequences. Formalized Mathematics, 12 (<bold>1</bold>):1–4, 2004.
Search in Google Scholar Back to article
[17] Konrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(<bold>3</bold>):441–444, 1990.
Search in Google Scholar Back to article
[18] Piotr Rudnicki and Andrzej Trybulec. On same equivalents of well-foundedness. Formalized Mathematics, 6(<bold>3</bold>):339–343, 1997.
Search in Google Scholar Back to article
[19] Bernd S. W. Schröder. Ordered Sets: An Introduction. Birkhäuser Boston, 2003. ISBN 978-1-4612-6591-7. <ext-link ext-link-type="uri" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://books.google.de/books?id=hg8GCAAAQBAJ">https://books.google.de/books?id=hg8GCAAAQBAJ</ext-link>.
Search in Google Scholar Back to article
[20] Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(<bold>3</bold>):569–573, 1990.
Search in Google Scholar Back to article
[21] Wojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(<bold>3</bold>):575–579, 1990.
Search in Google Scholar Back to article
[22] Wojciech A. Trybulec and Grzegorz Bancerek. Kuratowski – Zorn lemma. Formalized Mathematics, 1(<bold>2</bold>):387–393, 1990.
Search in Google Scholar Back to article