Nonhomogeneous analytic families of trees
DOI10.1090/TRAN/7517OpenAlexW2962857047WikidataQ128969267 ScholiaQ128969267MaRDI QIDQ5227975FDOQ5227975
Authors: James Hirschorn
Publication date: 7 August 2019
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.0147
Descriptive set theory (03E15) Other aspects of forcing and Boolean-valued models (03E40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Contents, measures, outer measures, capacities (28A12)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Happy families
- Title not available (Why is that?)
- The complete intersection theorem for systems of finite sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- How special are Cohen and random forcings, i. e. Boolean algebras of the family of subsets of reals moduli meagre or null
- Consistently there is no non trivial ccc forcing notion with the Sacks or Laver property
- COMPLETE CCC BOOLEAN ALGEBRAS, THE ORDER SEQUENTIAL TOPOLOGY, AND A PROBLEM OF VON NEUMANN
- Title not available (Why is that?)
- Maharam's problem
- ccc forcing and splitting reals
- Title not available (Why is that?)
- Nonhomogeneous analytic families of trees
Cited In (1)
This page was built for publication: Nonhomogeneous analytic families of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227975)