The combinatorial principle ⋄#

DOI10.2307/2273107zbMath0524.03043OpenAlexW2149645778MaRDI QIDQ3037423

Keith J. Devlin

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273107

zbMATH Keywords

Kurepa treecombinatorial principlediamond sharpaxiom of constructibilityuncountable regular cardinalclub setAronszajn subtreelarge cardinal versionprimitive recursively closed set

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55)

Related Items

Productively Lindelöf and indestructibly Lindelöf spaces ⋮ SQUARE WITH BUILT-IN DIAMOND-PLUS ⋮ Inclusion modulo nonstationary ⋮ Set-theoretic constructions of nonshrinking open covers ⋮ Models of Peano arithmetic and a question of Sikorski on ordered fields

Cites Work

• Order types, trees, and a problem of Erdős and Hajnal
• Unnamed Item