scientific article; zbMATH DE number 3587041

MaRDI QIDQ4156785zbMATH OpenFDO

Authors John P. Burgess

Publication date 1979

zbMATH Keywords

consistencycombinatorial set theoryaxiom of constructibility

Mathematics Subject Classification ID

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

Cited in

(2)

• S-forcing. IIa: Adding diamonds and more applications: Coding sets, Arhangel'skii's problem and \({\mathcal L}[Q_ 1^{<\omega},Q^ 1_ 2]\). (With an appendix by John P. Burgess)
• Some higher-gap examples in combinatorial set theory

This page was built for publication:

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