-definability at higher cardinals: Thin sets, almost disjoint families and long well-orders
From MaRDI portal
Publication:6064822
DOI10.1017/fms.2023.102arXiv2110.01468MaRDI QIDQ6064822
Publication date: 11 December 2023
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01468
Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55) Other notions of set-theoretic definability (03E47)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Hurewicz dichotomy for generalized Baire spaces
- Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties
- Covering theorems for the core model, and an application to stationary set reflection
- The bounded proper forcing axiom and well orderings of the reals
- Guessing and non-guessing of canonical functions
- Some applications of short core models
- Infinite combinatorics and definability
- Intermediate submodels and generic extensions in set theory
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- \(\mathbf{L}(\mathbb{R})\) with determinacy satisfies the Suslin hypothesis
- On the non-existence of mad families
- Martin's maximum\(^{++}\) implies Woodin's axiom \((*)\)
- Partition properties for simply definable colourings
- A characterization of generalized Příkrý sequences
- Definable MAD families and forcing axioms
- Perfect subtree property for weakly compact cardinals
- KWithout the Measurable
- -definability at uncountable regular cardinals
- Ramsey-like cardinals
- Ramsey-like cardinals II
- Prikry-Type Forcings
- An Outline of Inner Model Theory
- A Core Model Toolbox and Guide
- Forcing over Models of Determinacy
- Iterated ultrapowers and prikry forcing
- Stacking mice
- Indescribable cardinals and elementary embeddings
- Sets constructible from sequences of ultrafilters
- Happy families
- HAPPY AND MAD FAMILIES INL(ℝ)
- PERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMES
- Set Theory
- The bounded proper forcing axiom
- Definable combinatorics at the first uncountable cardinal
- The size of the class of countable sequences of ordinals
- Maximal almost disjoint families, determinacy, and forcing
- Measurable cardinals and good ‐wellorderings
- STABLY MEASURABLE CARDINALS
- CLOSURE PROPERTIES OF MEASURABLE ULTRAPOWERS
- Locally Σ1-definable well-orders of H(κ+)
- The Ramsey property implies no mad families
- LARGE CARDINALS AND LIGHTFACE DEFINABLE WELL-ORDERS, WITHOUT THE GCH
- Σ1(κ)-DEFINABLE SUBSETS OF H(κ+)
- Σ12 and Π11 Mad Families
- Trees
- Inner models and large cardinals
This page was built for publication: -definability at higher cardinals: Thin sets, almost disjoint families and long well-orders