A new construction of a Kurepa tree with no Aronszajn subtree

DOI10.4064/FM-118-2-123-127zbMATH Open0536.03027OpenAlexW1144401396MaRDI QIDQ3320355FDOQ3320355

Authors: Keith Devlin 

Publication date: 1983

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/211378

Recommendations

• scientific article; zbMATH DE number 96346
• Kurepa trees and topological non-reflection
• Constructing trees in graphs with no K_2,s
• On Aronszajn trees with a non-Souslin base
• On the existence and construction of non-extreme \((a,b)\)-trees.
• On the spectra of cardinalities of branches of Kurepa trees
• Constructing Trees in Graphs whose Complement has no K_2,s
• Some independence results related to the Kurepa tree
• Kurepa trees and the failure of the Galvin property
• A tree version of Kőnig's theorem

zbMATH Keywords

Kurepa treeAronszajn tree

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cited In (4)

• Can You Take Komjath's Inaccessible Away?
• A minimal Kurepa tree with respect to club embeddings
• Models of Peano arithmetic and a question of Sikorski on ordered fields
• Title not available (Why is that?)

This page was built for publication: A new construction of a Kurepa tree with no Aronszajn subtree

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