English
Related papers

Related papers: Two Answers to a Common Question on Diagonalizatio…

200 papers

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

Number Theory · Mathematics 2014-02-26 Javier Cilleruelo , D. S. Ramana , Olivier Ramare

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…

Logic · Mathematics 2019-05-17 Ruadhan O'Flanagan

The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…

Logic · Mathematics 2026-04-10 Dag Normann , Sam Sanders

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

Logic in Computer Science · Computer Science 2023-07-28 Fabian Mitterwallner , Aart Middeldorp , René Thiemann

The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…

Analysis of PDEs · Mathematics 2015-04-07 Markus Lange-Hegermann

We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…

History and Overview · Mathematics 2009-08-04 S. A. Belbas

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves…

Logic · Mathematics 2025-10-20 Saeed Salehi

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan , Angel V. Kumchev

We study first-order expansions of the reals which do not define the set of natural numbers. We also show that several stronger notions of tameness are equivalent to each others.

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Number Theory · Mathematics 2007-05-23 Thomas Garrity

A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…

Number Theory · Mathematics 2007-05-23 Philip Gibbs

A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…

Logic in Computer Science · Computer Science 2025-10-17 Sara Ayhan

Continued fractions are used to give an alternate proof of $e^{x/y}$ is irrational.

History and Overview · Mathematics 2021-04-14 Sourangshu Ghosh

We prove the irrationality of some factorial series. To do so we combine methods from elementary and analytic number theory with methods from the theory of uniform distribution.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

Other Computer Science · Computer Science 2007-05-23 Pierre B. A. Lecomte , Michel Rigo

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

Logic in Computer Science · Computer Science 2017-03-06 Matthias Horbach , Marco Voigt , Christoph Weidenbach

It is shown that any denumerable list L to which Cantor's diagonal method was applied is incomplete. However, this doesn't allow us to affirm that the cardinality of the real numbers of the interval [0, 1] is greater than the cardinality of…

General Mathematics · Mathematics 2007-05-23 Jailton C. Ferreira

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…

Number Theory · Mathematics 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…

Logic · Mathematics 2023-08-10 Martin Klazar

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…

General Mathematics · Mathematics 2010-01-12 Dhurjati Prasad Datta