Skip to main content
SpringerLink
Log in

On dilworth’s theorem in the in finite case

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

The following theorem is proved: Letc be an infinite cardinal. There exists a partially ordered set of cardinalc, which contains no infinite independent subset, and which is not decomposable into less thanc chains.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliography

  1. Dilworth, R. P., 1950, A decomposition theorem for partially ordered sets,Ann. of Math.,51, 161–166.

    Article  MathSciNet  Google Scholar 

  2. Perles, M. A., 1963, A proof of Dilworth’s decomposition theorem for partially ordered sets,Israel Jour. Math.,1, 105.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Israel

    Micha A. Peles

Authors
  1. Micha A. Peles
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peles, M.A. On dilworth’s theorem in the in finite case. Israel J. Math. 1, 108–109 (1963). https://doi.org/10.1007/BF02759806

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation