Related papers: Two Answers to a Common Question on Diagonalizatio…
We prove a version of $Z$-set unknotting theorem for uncountable products of real numbers.
We show that normality for continued fractions expansions and normality for base-$b$ expansions are maximally logically separate. In particular, the set of numbers that are normal with respect to the continued fraction expansion but not…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.
A definition of what counts as an explanation of mathematical statement, and when one explanation is better than another, is given. Since all mathematical facts must be true in all causal models, and hence known by an agent, mathematical…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…
We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…
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…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
Basic arithmetic is the cornerstone of mathematics and computer sciences. In arithmetic, 'division by zero' is an undefined operation and any attempt at extending logic for algebraic division to incorporate division by zero has resulted in…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…
A rational number is dyadic if it has a finite binary representation $p/2^k$, where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in…
These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
Science and mathematics help people better to understand world, eliminating different fallacies and misconceptions. One of such misconception is related to arithmetic, which is so important both for science and everyday life. People think…
Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…