Related papers: Extensional constructive real analysis via locator…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
Data analyses are often constructed in an imperative manner, where commands representing actions taken on the data are issued sequentially. The publication of these commands, along with the data, is essential to the reproducibility of the…
Recently uncovered second derivative discontinuous solutions of the simplest linear ordinary differential equation define not only an nonstandard extension of the framework of the ordinary calculus, but also provide a dynamical…
We prove that Tietze Extension does not always exist in constructive mathematics if closed sets on which the function we are extending are defined as sequentially closed sets. Firstly, we take a discrete metric space as our topological…
This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…
Researchers are often perplexed when their machine learning algorithms are required to deal with complex number. Various strategies are commonly employed to project complex number into real number, although it is frequently sacrificing the…
Lookup tables (finite maps) are a ubiquitous data structure. In pure functional languages they are best represented using trees instead of hash tables. In pure functional languages within constructive logic, without a primitive integer…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
This paper investigates the possibility of constructive extraction of measurable selector from set-valued maps which may commonly arise in viability theory, optimal control, discontinuous systems etc. For instance, existence of solutions to…
The concept of identifiability describes the possibility of inferring the parameters of a dynamic model by observing its output. It is common and useful to distinguish between structural and practical identifiability. The former property is…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
We present a detailed and elementary construction of the real numbers from the rational numbers a la Bourbaki. The real numbers are defined to be the set of all minimal Cauchy filters in $\mathbb{Q}$ (where the Cauchy condition is defined…
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…
The real numbers are important in both mathematics and computation theory. Computationally, real numbers can be represented in several ways; most commonly using inexact floating-point data-types, but also using exact arbitrary-precision…