A diamond example of an ordinal graph with no infinite paths

DOI10.1016/0168-0072(90)90013-RzbMath0703.03028OpenAlexW2070331185MaRDI QIDQ915724

James E. Baumgartner, Jean A. Larson

Publication date: 1990

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90013-r

zbMATH Keywords

treediamondinfinite pathordinal graph

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Related Items (5)

Partition relations on a plain product order type ⋮ In memoriam: James Earl Baumgartner (1943--2011) ⋮ Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado ⋮ Matchings from a set below to a set above ⋮ A GCH Example of an Ordinal Graph with no Infinite Path

Cites Work

• Teilmengen von Mengen mit Relationen
• Martin's axiom and ordinal graphs: Large independent sets or infinite paths
• An Independence Result for Pinning for Ordinals
• Unnamed Item
• Unnamed Item

This page was built for publication: A diamond example of an ordinal graph with no infinite paths