On the complexity of classes of uncountable structures: trees on $\aleph _1$

DOI10.4064/fm910-6-2020OpenAlexW3095003305MaRDI QIDQ5162554

Dániel T. Soukup, Sy-David Friedman

Publication date: 3 November 2021

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

Full work available at URL: https://arxiv.org/abs/1906.00849

zbMATH Keywords

reductionAronszajn treeprojectiveKurepa treeBorelSuslin treedefinable

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Club isomorphisms on higher Aronszajn trees
• Isomorphism types of Aronszajn trees
• \(\text{PFA}(S)[S\) for the masses]
• Club-isomorphisms of Aronszajn trees in the extension with a Suslin tree
• Higher Souslin trees and the GCH, revisited
• A microscopic approach to Souslin-tree constructions. I.
• Generalized Descriptive Set Theory and Classification Theory
• Trees and -subsets of ^ω1ω₁
• The Canary Tree
• The canary tree revisited
• Stationary sets and infinitary logic
• Aronszajn trees, square principles, and stationary reflection
• Δ₁-Definability of the non-stationary ideal at successor cardinals
• Classes of structures with universe a subset of  1
• Embedding Trees in the Rationals

This page was built for publication: On the complexity of classes of uncountable structures: trees on $\aleph _1$