Upper and Lower Bounds

Bernd S. W. Schröder
Additional contact information
Bernd S. W. Schröder: Lousiana Tech University, Program of Mathematics and Statistics

Chapter 3 in Ordered Sets, 2003, pp 55-76 from Springer

Abstract: Abstract Upper and lower bounds have already been defined in Definitions 2.1.4 and 2.3.1. From their use in Zorn’s Lemma, as well as their occurrences in the proofs of Dilworth’s Chain-Decomposition Theorem 2.5.7 and Proposition 2.6.7 (in both proofs, sets were defined in terms of their upper bounds), the reader can already infer that bounds of sets play an important role in ordered sets. In this chapter we consider various types of bounds and relate them to open problems as well as to each other.

Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-0053-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461200536

DOI: 10.1007/978-1-4612-0053-6_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().