Complete ordered sets with no infinite antichains

DOI10.1016/0012-365X(81)90200-4zbMATH Open0466.06002OpenAlexW1992951048MaRDI QIDQ1155071FDOQ1155071

Authors: Dwight Duffus, Maurice Pouzet, Ivan Rival 

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90200-4

zbMATH Keywords

idealsRamsey's theoreminitial segmentscompletion by cutscompletions of an ordered setfinite antichains

Mathematics Subject Classification ID

Partial orders, general (06A06) Complete lattices, completions (06B23)

Cites Work

• Hüllensysteme und Erweiterung von Quasi‐Ordnungen
• Partial well‐ordering of sets of vectors
• A partition calculus in set theory
• Well-quasi-orderings and sets of finite sequences
• On a classification of denumerable order types and an application to the partition calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Certain partially ordered sets of dimension three
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Ordered sets with no infinite antichains
• Finite dimensional scattered posets
• Ordered sets with no chains of ideals of a given type
• The smallest order variety containing all chains
• On minimal prime graphs and posets
• Antichains of monomial ideals are finite
• The Erdős-Dushnik-Miller theorem for topological graphs and orders
• The length of chains in modular algebraic lattices
• Obituary: Ivan Rival

This page was built for publication: Complete ordered sets with no infinite antichains

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