Compactness and subsets of ordered sets that meet all maximal chains

DOI10.1007/BF00565650zbMATH Open0555.06001OpenAlexW1997730101MaRDI QIDQ760448FDOQ760448

Authors: J. Ginsburg 

Publication date: 1984

Published in: Order (Search for Journal in Brave)

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

Recommendations

• Antichains and Finite Sets that Meet all Maximal Chains
• scientific article; zbMATH DE number 3957179
• A minimax theorem for chain complete ordered sets
• A maximal chain approach to topology and order
• Maximal chains and cutsets of an ordered set: A Menger type approach

zbMATH Keywords

forbidden substructuresmaximal antichainchain complete ordered setcharacterization of compactnessspace of maximal chains

Mathematics Subject Classification ID

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

Cites Work

• Maximal chains and antichains
• Compact Spaces and Spaces of Maximal Complete Subgraphs
• Antichains and Finite Sets that Meet all Maximal Chains
• Finite cutsets and finite antichains

Cited In (10)

• Une propriété des familles d'ensembles bien ordonnés linéaires
• Title not available (Why is that?)
• A chain decomposition theorem
• A maximal chain approach to topology and order
• On the treatment of incomparability in ordering semantics and premise semantics
• Cutsets of Boolean lattices
• Extensions of ordered sets having the finite cutset property
• Finite antichain cutsets in posets
• Ladders in ordered sets
• Maximal chains in positive subfamilies of \(P(\omega )\)

This page was built for publication: Compactness and subsets of ordered sets that meet all maximal chains

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