TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS

DOI10.1017/jsl.2022.36OpenAlexW3084859867MaRDI QIDQ5052007

Jonathan Schilhan

Publication date: 18 November 2022

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

Full work available at URL: https://arxiv.org/abs/2009.06445

zbMATH Keywords

forcingdefinabilitydescriptive set theoryultrafilterscardinal characteristicsconstructible universesplitting forcing

Mathematics Subject Classification ID

Hypergraphs (05C65) Descriptive set theory (03E15) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Cardinal characteristics of the continuum (03E17)

Related Items (2)

TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS ⋮ On slow minimal reals I

Cites Work

• Unnamed Item
• Unnamed Item
• Co-analytic mad families and definable wellorders
• Projective wellorders and mad families with large continuum
• Splitting squares
• Infinite combinatorics and definability
• Complexity of reals in inner models of set theory
• Mutual generics and perfect free subsets
• Definable maximal discrete sets in forcing extensions
• Coanalytic ultrafilter bases
• Antichains of perfect and splitting trees
• Ramsey and Freeness Properties of Polish Planes
• A co-analytic maximal set of orthogonal measures
• THE SELECTOR PRINCIPLE FOR ANALYTIC EQUIVALENCE RELATIONS DOES NOT IMPLY THE EXISTENCE OF AN $ A_2$ WELL ORDERING OF THE CONTINUUM
• Iterated perfect-set forcing
• Selection Theorems for G δ -Valued Multifunctions
• Some additive properties of sets of real numbers
• Lusin Sets and Well Ordering the Continuum
• Hamel bases and well–ordering the continuum
• A CO-ANALYTIC COHEN-INDESTRUCTIBLE MAXIMAL COFINITARY GROUP
• Definable towers
• TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS
• More on trees and Cohen reals
• A Sacks indestructible co-analytic maximal eventually different family
• Definable maximal independent families
• Analytic countably splitting families
• Transfinite inductions producing coanalytic sets
• Mad Families Constructed from Perfect Almost Disjoint Families
• Un théorème de séparabilité pour les produits topologiques
• Consistency of the Continuum Hypothesis. (AM-3)

This page was built for publication: TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS