Coding that preserves Ramseyness

DOI10.4064/FM-129-1-1-7MaRDI QIDQ3812240zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in Fundamenta Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

Coding Theoremcore modelforcing extensionRamsey cardinal

Mathematics Subject Classification ID

Consistency and independence results (03E35)

Recommendations

• Coding over a measurable cardinal
• Coding into 𝐾 by reasonable forcing
• Easton's theorem for Ramsey and strongly Ramsey cardinals
• Strong coding
• Minimal coding

Cited in

(4)

• Indestructibility properties of Ramsey and Ramsey-like cardinals
• Coding into Ramsey sets
• Coding into 𝐾 by reasonable forcing
• Coding over core models

This page was built for publication: Coding that preserves Ramseyness

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