Search arXivSearch

arXiv · 2608.21649

Ideals, Well-Orderable Families, and Baire Category in Truss's Feferman-Type Model

Abstract

Let $\mathsf{BCT}_{\mathsf{WO}}$ assert that every well-orderable family of dense open subsets of a perfect Polish space has dense intersection, and let $\mathsf{RS}_{\mathsf{WO}}$ assert that for every nonempty countable partial order, there is a filter meeting every member of any given well-orderable family of dense subsets. Over $\mathsf{ZF}$ they are shown to be equivalent. We show that in Truss's model, they characterize those $A\subseteq2^ω$ for which every $A$-indexed family of dense open sets has dense intersection. Assuming choice for well-orderable families of nonempty sets, we obtain an analogous characterization for total relations $R\subseteq X\times Y$ with meager vertical sections, whenever $Y$ is a surjective image of $2^ω$. The Feferman-type model $\mathfrak N_{\aleph_1}$ studied by Truss \cite{Truss1974} satisfies these hypotheses and $\mathsf{DC}$. We study the ideal of well-orderable subsets of $2^ω$ and its relations to other ideals in this model. We show, among other things: the well-orderable subsets of $2^ω$ are exactly the sets which are Rothberger in every finite power, have strong measure zero, are universally null, are Marczewski null, or contain no perfect subset. The ideal of well-orderable subsets of $2^ω$ is closed under well-ordered unions and is incomparable with the meager ideal. The equivalence with the Rothberger property does not extend to the Hurewicz property. Further more, in this model every set is Marczewski measurable, arbitrary maps into separable metric spaces have continuous perfect restrictions, and every set of positive outer measure contains a perfect subset.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Zesheng Chen. 2026-08-21. Ideals, Well-Orderable Families, and Baire Category in Truss's Feferman-Type Model. https://arxiv.org/abs/2608.21649

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO