SearcharxivSearch

arXiv · 2607.15723

Paraconsistent Dominated Convergence

Abstract

The Levi-Civita field $\mathcal{R}$ of formal Laurent series is a constructive, non-Archimedean ordered field that supports a full Lebesgue measure and integration theory, including a Dominated Convergence Theorem. This paper embeds that integration theory into the paraconsistent Chunk and Permeate framework, extending it from elementary calculus to genuine measure theory. The source chunk is modelled by $\mathcal{R}$ with its measure and integral, while the target chunk is the classical real line $\mathbb{R}$. A permeability relation exports the standard part of the internal integral, and it is shown that the Dominated Convergence Theorem permeates from the source chunk to the target chunk, yielding the classical Lebesgue Dominated Convergence Theorem without any choice principles and without the ultrafilters required by nonstandard measure theory. The construction is entirely explicit and demonstrates that paraconsistent logic can provide a rigorous foundation for deep analytical tools while keeping inconsistencies safely confined.

Explore related subjects

Keep this discovery

BibTeXRIS

Anggha Nugraha. 2026-07-17. Paraconsistent Dominated Convergence. https://arxiv.org/abs/2607.15723

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