Searcharxiv⌕ Search

arXiv · 2611.14366

Independent Families Under Determinacy-Like Hypotheses

Abstract

We generalize the notion of an independent family on $ω$ to $\mathcal{J}$-independent families on an arbitrary cardinal $κ$ and then show that under determinacy-like hypotheses that there can be no such families for reasonable $\mathcal{J}$. This is quite atypical as all other generalizations of the kinds of combinatorial families coming from the theory of cardinal characteristics follow a very different pattern, which will also be explained; in this sense independent families seem particularly special. The base theory assumed throughout is $\textsf{ZF + }$All infinite sets are Dedekind infinite.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stewart Bahrke, Nam Trang. 2026-11-10. Independent Families Under Determinacy-Like Hypotheses. https://searcharxiv.com/abs/2611.14366

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗