Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1702.07261

A Generalization of the Cantor-Dedekind Continuum with Nilpotent Infinitesimals

José Roquette
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a generalization of the Cantor-Dedekind continuum with explicit infinitesimals. These infinitesimals are used as numbers obeying the same basic rules as the other elements of the generalized continuum, in accordance with Leibniz's original intuition, but with an important difference: their product is null, as the Dutch theologian Bernard Nieuwentijt sustained, against Leibniz's opinion. The starting-point is the concept of shadow, and from it we define indiscernibility (the central concept) and monad. Monads of points have a global-local nature, because in spite of being infinite-dimensional real affine spaces with the same cardinal as the whole generalized continuum, they are closed intervals with length 0. Monads and shadows (initially defined for points) are then extended to any subset of the new continuum, and their study reveals interesting results of preservation in the areas of set theory and topology. All these concepts do not depend on a definition of limit in the new continuum; yet using them we obtain the basic results of the differential calculus. Finally, we give two examples illustrating how the global-local nature of the monad of a real number can be applied to the differential treatment of certain singularities.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

José Roquette. 2017-02-23. A Generalization of the Cantor-Dedekind Continuum with Nilpotent Infinitesimals. https://arxiv.org/abs/1702.07261

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↗