相关论文: Countability of the Real Numbers
Hilbert's first problem is of importance in relation to work being done in computational systems. It is the question of equipollence of natural and real numbers. By construction equipollence is established for real numbers in open interval…
Numbers are often used to define more complicated numbers. For example, two integers are used to define a rational number and two reals are used to define a complex number. It might be expected that an irrational power of an irrational…
A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…
In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…
A. Renyi \cite{Renyi} made a definition that gives one generalization of simple normality in the context of $Q$-Cantor series. Similarly, in this paper we give a definition which generalizes the notion of normality in the context of…
Complex numbers play a crucial role in quantum mechanics. However, their necessity remains debated: whether they are fundamental or merely convenient. Recently, it was claimed that quantum mechanics based on real numbers can be…
This paper grew out of the observation that the possibilities of proof by induction and definition by recursion are often confused. The paper reviews the distinctions. The von Neumann construction of the ordinal numbers includes a…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…
What is the distance between 11 (a prime number) and 12 (a highly composite number)? If your answer is 1, then ask yourself "is this reasonable?" In this work, we will introduce a distance between natural numbers based on their arithmetic…
A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…
This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced…
We prove a version of $Z$-set unknotting theorem for uncountable products of real numbers.
It is known that the ordered Bell numbers count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of $[n]$. We first study…
In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…
We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
We prove that if the bounding number (d) is bigger than the reaping number (r), then the latter has uncountable cofinality.
We introduce the notion of indivisible sequences and show that to any indivisible sequence $\{S, \Psi: S \to R\}$ we can associate faithfully flat ring maps $R \to R'$ that are not descendable. As a corollary, we obtain the first example of…
The First Hilbert problem is studied in this paper by applying two instruments: a new methodology distinguishing between mathematical objects and mathematical languages used to describe these objects; and a new numeral system allowing one…