Coherent trees that are not Countryman

DOI10.1007/s00153-017-0530-2zbMath1417.03251OpenAlexW2604629781MaRDI QIDQ527329

Yinhe Peng

Publication date: 11 May 2017

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-017-0530-2

zbMATH Keywords

coherentlexicographical orderCountrymanminimal walk

Mathematics Subject Classification ID

Consistency and independence results (03E35) Total orders (06A05) Other combinatorial set theory (03E05)

Cites Work

• A five element basis for the uncountable linear orders
• A universal Aronszajn line
• Partitioning pairs of countable ordinals
• Decomposing uncountable squares to countably many chains
• Walks on ordinals and their characteristics
• A solution to the L space problem

This page was built for publication: Coherent trees that are not Countryman