Related papers: On Non-standard Models of Arithmetic with Uncounta…
We examine the relation of BSS-reducibility on subsets of the real numbers. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSS-computation to be BSS-reducible to a countable set.…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…
Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all…
Model-theoretic frameworks for Nonstandard Analysis depend on the existence of nonprincipal ultrafilters, a strong form of the Axiom of Choice (AC). Hrbacek and Katz, APAL 72 (2021) formulate axiomatic nonstandard set theories SPOT and SCOT…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
Remarks on the Cantor's nondenumerability proof of 1891 that the real numbers are noncountable will be given. By the Cantor's diagonal procedure, it is not possible to build numbers that are different from all numbers in a general assumed…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…
This paper outlines new paradigms for real analysis and computability theory in the recently proposed non-Aristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
The consideration of nonstandard models of the real numbers and the definition of a qualitative ordering on those models provides a generalization of the principle of maximization of expected utility. It enables the decider to assign…
This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…
We compare two methods for evaluating the cardinality of the Cartesian product $N \times N$ of the set of natural numbers $N$. The first is used to explain the thermodynamics of black body radiation by using convergent functions on $N…
Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas of computer science. Their development was also inextricably…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems,…
Following the work of [Dikranjan et al., Fund. Math. 249:185-209, 2020] for arithmetic sequences, very recently in [Das et al., Expo. Math. 43(3):125653, 2025], statistically characterized subgroups have been investigated for certain types…
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 --…