Slender trees and the approximation property

DOI10.1007/S00153-025-00984-3MaRDI QIDQ6866597zbMATH OpenFDO

Authors Hannes Jakob

Publication date 28 January 2026

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/S00153-025-00984-3

zbMATH Keywords

forcinglarge cardinalsindependence resultsslender trees

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 702561 (Why is no real title available?)
• A general Mitchell style iteration
• Disjoint stationary sequences on an interval of cardinals
• Fragility and indestructibility of the tree property
• Fragility and indestructibility. II
• Fragments of Martin's Maximum in generic extensions
• Gap Forcing: Generalizing the Lévy-Solovay Theorem
• Guessing models and the approachability ideal
• Iterated forcing and elementary embeddings
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• On disjoint stationary sequences
• Quotients of strongly proper forcings and guessing models
• Set Theory
• Set theory.
• Small embedding characterizations for large cardinals
• Strong tree properties for small cardinals
• Strong tree properties, Kurepa trees, and guessing models
• Successive failures of approachability
• The tree property
• Variants of Mitchell forcing

This page was built for publication: Slender trees and the approximation property

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