BOOK-CHAPTER

Chains, Antichains and Fences

Abstract

Chains and antichains are arguably the most common kinds of ordered sets in mathematics. The elementary number systems ℕ , ℤ, ℚ and ℝ (with the exception of course being ℂ) are chains. Chains are also at the heart of set theory. The Axiom of Choice is equivalent to Zorn's Lemma (which we will adopt as an axiom) and the Well-Ordering Theorem. Both latter results are results about chains.

Keywords:
Axiom of choice Lemma (botany) Zermelo–Fraenkel set theory Axiom Mathematics Set (abstract data type) Chain (unit) Partially ordered set Discrete mathematics Set theory Mathematical economics Combinatorics Computer science Physics Quantum mechanics Programming language Geometry

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.36
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Advanced Algebra and Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Computability, Logic, AI Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Logic, Reasoning, and Knowledge
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

BOOK-CHAPTER

Chains, Antichains, and Fences

Bernd S. W. Schröder

Year: 2016 Pages: 23-51
BOOK-CHAPTER

Chains and Antichains

Stasys Jukna

Texts in theoretical computer science Year: 2001 Pages: 97-108
BOOK-CHAPTER

Chains and antichains

Nathalie CaspardBruno LeclercBernard Monjardet

Cambridge University Press eBooks Year: 2012 Pages: 107-129
BOOK-CHAPTER

Chains and Antichains

Stasys Jukna

Texts in theoretical computer science Year: 2011 Pages: 107-118
JOURNAL ARTICLE

Trapezoidal Chains and Antichains

John R. Stembridge

Journal:   European Journal of Combinatorics Year: 1986 Vol: 7 (4)Pages: 377-387
© 2026 ScienceGate Book Chapters — All rights reserved.