Skip to main content
Log in

The strong selection property and ordered sets of finite length

  • Published:
algebra universalis Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. D. Duffus, W. Poguntke andI. Rival,Retracts and the fixed point problem for finite partially ordered sets. Cand. Math. Bull.23 (1980), 231–236.

    Google Scholar 

  2. D. Duffus andI. Rival,A structure theory for ordered sets. Discrete Math.35 (1981), 53–118.

    Google Scholar 

  3. M. Pouzet andI. Rival,Every countable lattice is a retract of a direct product of chains. Alg. Universalis18 (1984), 295–307.

    Google Scholar 

  4. I. Rival andR. Wille,The smallest order variety containing all chains. Discrete Math.35 (1981), 203–212.

    Google Scholar 

  5. A. Tarski,Ordinal algebras. North-Holland, Amsterdam 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nevermann, P., Wille, R. The strong selection property and ordered sets of finite length. Algebra Universalis 18, 18–28 (1984). https://doi.org/10.1007/BF01182246

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01182246

Keywords

Navigation