Coding and anticoding of a cardinal by bounded subsets of the cardinal
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4108752 (Why is no real title available?)
- scientific article; zbMATH DE number 3675879 (Why is no real title available?)
- scientific article; zbMATH DE number 3762048 (Why is no real title available?)
- scientific article; zbMATH DE number 3781158 (Why is no real title available?)
- scientific article; zbMATH DE number 3273165 (Why is no real title available?)
- A computation of 𝛿¹₅
- A dichotomy for the definable universe
- Almost Everywhere Behavior of Functions According to Partition Measures
- An introduction to combinatorics of determinacy
- An outline of inner model theory
- Descriptive set theory
- Determinacy and Jónsson cardinals in \(L(\mathbb{R})\)
- Equivalence of partition properties and determinacy
- Happy families
- Infinitary combinatorics and the axiom of determinateness
- More definable combinatorics around the first and second uncountable cardinals
- On the determinacy of games on ordinals
- On the verge of inconsistency: Magidor cardinals and Magidor filters
- Ordinal definability and combinatorics of equivalence relations
- Ordinal definability in models of determinacy. Introduction to Part V
- Some weak versions of large cardinal axioms
- Structural consequences of AD
This page was built for publication: Coding and anticoding of a cardinal by bounded subsets of the cardinal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844093)