Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.05276

Continuity in Potential Infinite Models

Matthias Eberl
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a model of simple type theory with potential infinite carrier sets. The functions in this model are automatically continuous, as defined in this paper. This notion of continuity does not rely on topological concepts, including domain theoretic concepts, which essentially use actual infinite sets. The model is based on the concept of a factor system, which generalizes direct and inverse systems. A factor system is basically an extensible set indexed over a directed set of stages, together with a predecessor relation between object states at different stages. The function space, when considered as a factor system, expands simultaneously with its elements. On the one hand, the space is subdivided more and more, on the other hand, the elements increase and are defined more and more precisely. In addition, a factor system allows the construction of limits that are part of its expansion process and not outside of it. At these limits, elements are indefinitely large or small, which is a contextual notion and a substitute for elements that are infinitely large or small (points). This dynamic and contextual view is consistent with an understanding of infinity as a potential infinite.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Matthias Eberl. 2025-01-09. Continuity in Potential Infinite Models. https://arxiv.org/abs/2501.05276

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↗