TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS

DOI10.1017/JSL.2022.36MaRDI QIDQ5052007OpenAlexFDO

Authors Jonathan Schilhan

Publication date 18 November 2022

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

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

zbMATH Keywords

forcingdefinabilityultrafilterscardinal characteristicsdescriptive set theoryconstructible universesplitting forcing

Mathematics Subject Classification ID

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

Recommendations

• HIGHER INDEPENDENCE
• Hypergraphs and proper forcing
• Definable maximal independent families
• The spectrum of independence. II
• CON(\(\mathfrak u>\mathfrak i\))

Cites work

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

Cited in

(4)

• Tree forcing and definable maximal independent sets in hypergraphs
• TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS
• HIGHER INDEPENDENCE
• On slow minimal reals I

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

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