Cardinal invariants concerning functions whose sum is almost continuous

Krzysztof Ciesielski; Arnold W. Miller

Home/Archive/arXiv

arXiv · math/9410201

Cardinal invariants concerning functions whose sum is almost continuous

Krzysztof Ciesielski·Arnold W. Miller

View original source ↗Read source document ↗Export metadata ↓

Abstract

A function f from reals to reals (f:R->R) is almost continuous (in the sense of Stallings) iff every open set in the plane which contains the graph of f contains the graph of a continuous function. Natkaniec showed that for any family F of continuum many real functions there exists g:R->R such that f+g is almost continuous for every f in F. Let AA be the smallest cardinality of a family F of real functions for which there is no g:R->R with the property that f+g is almost continuous for every f in F. Thus Natkaniec showed that AA is strictly greater than the continuum. He asked if anything more could be said. We show that the cofinality of AA is greater than the continuum, c. Moreover, we show that it is pretty much all that can be said about AA in ZFC, by showing that AA can be equal to any regular cardinal between c^+ and 2^c (with 2^c arbitrarily large). We also show that AA = AD where AD is defined similarly to AA but for the class of Darboux functions. This solves another problem of Maliszewski and Natkaniec.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Krzysztof Ciesielski, Arnold W. Miller. 1994-10-26. Cardinal invariants concerning functions whose sum is almost continuous. https://arxiv.org/abs/math/9410201

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗