SearcharxivSearch

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^\omega$ 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^\omega$. 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^\omega$ and its relations to other ideals in this model. We show, among other things: the well-orderable subsets of $2^\omega$ 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^\omega$ 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

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO