✦ LIBER ✦

A Theorem on Ordered Sets

✍ Scribed by Walker, A. G.

Book ID: 120100490
Publisher: Oxford University Press
Year: 1946
Tongue: English
Weight: 58 KB
Volume: s1-21
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-21.1.9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Theorem on Ordered Sets of Probability

A Theorem on Ordered Sets of Probability Distributions

✍ Cramer, Harald 📂 Article 📅 1956 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 524 KB

On a fixed point theorem for partially o

On a fixed point theorem for partially ordered sets

✍ Paul H. Edelman 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 358 KB

A Theorem on Partial Well-Ordering of Se

A Theorem on Partial Well-Ordering of Sets of Vectors

✍ Erdos, P.; Rado, R. 📂 Article 📅 1959 🏛 Oxford University Press 🌐 English ⚖ 84 KB

On the Dedekind-MacNeille closure of an

On the Dedekind-MacNeille closure of an ordered set and a theorem of Novák

✍ Egbert Harzheim 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 606 KB

A Decomposition Theorem for Partially Or

A Decomposition Theorem for Partially Ordered Sets

✍ R. P. Dilworth 📂 Article 📅 1950 🏛 John Hopkins University Press 🌐 English ⚖ 489 KB

A minimax theorem for chain complete ord

A minimax theorem for chain complete ordered sets

✍ Henry A. Kierstead 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 513 KB

It is shown that if a chain complete ordered set does not have k+ 1 pairwise disjoint maximal chains for some finite k, then the minimum size of a cutset is equal to the maximum size of a collection of pairwise disjoint maximal chains. This answers a question of Pouzet and Zaguia.