A minimax theorem for chain complete ordered sets

DOI10.1007/BF00143899MaRDI QIDQ1109795zbMATH OpenOpenAlexFDO

Authors H. A. Kierstead

Publication date 1988

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00143899

zbMATH Keywords

maximal chaincutsetchain complete ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Compactness (54D30)

Recommendations

• Publication:3726173
• The PT-order, minimal cutsets and Menger property
• Finite cutsets and finite antichains
• Antichains and Finite Sets that Meet all Maximal Chains
• Maximal chains and cutsets of an ordered set: A Menger type approach

Cited in

(4)

• The Menger property for infinite ordered sets
• The PT-order, minimal cutsets and Menger property
• Compactness and subsets of ordered sets that meet all maximal chains
• Maximal chains and cutsets of an ordered set: A Menger type approach

This page was built for publication: A minimax theorem for chain complete ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109795)