中文
相关论文

相关论文: Three beliefs that lend illusory legitimacy to Can…

200 篇论文

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…

逻辑 · 数学 2022-06-28 Sam Sanders

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…

量子物理 · 物理学 2019-05-21 Alessio Benavoli , Alessandro Facchini , Marco Zaffalon

Generalizing a geometric idea due to J. Sondow, we give a geometric proof for the Cantor's Theorem. Moreover, it is given an irrationality measure for some Cantor series.

历史与综述 · 数学 2010-12-30 Diego Marques

I'll discuss how Goedel's paradox "This statement is false/unprovable" yields his famous result on the limits of axiomatic reasoning. I'll contrast that with my work, which is based on the paradox of "The first uninteresting positive whole…

历史与综述 · 数学 2007-05-23 G. J. Chaitin

We introduce a generalization of the Cantor-Dedekind continuum with explicit infinitesimals. These infinitesimals are used as numbers obeying the same basic rules as the other elements of the generalized continuum, in accordance with…

逻辑 · 数学 2017-02-24 José Roquette

We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…

组合数学 · 数学 2011-11-29 Srečko Brlek , Jean-Philippe Labbé , Michel Mendès France

Practicing mathematicians often assume that mathematical claims, when they are true, have good reasons to be true. Such a state of affairs is "unreasonable", in Wigner's sense, because basic results in computational complexity suggest that…

历史与综述 · 数学 2024-10-28 Simon DeDeo

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…

计算机科学中的逻辑 · 计算机科学 2017-03-06 Matthias Horbach , Marco Voigt , Christoph Weidenbach

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…

逻辑 · 数学 2020-03-30 Ivan Georgiev , Lars Kristiansen , Frank Stephan

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…

数论 · 数学 2026-04-14 Divyum Sharma , L. Singhal

In the present article, modeling certain rational numbers, that are represented in terms of Cantor series, are described. The statements on relations between digits in the representations of rational numbers by Cantor series (for the case…

数论 · 数学 2021-01-05 Symon Serbenyuk

We take an argument of G\"odel's from his ground-breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: the sentence $G$ says about itself that it is not provable, and $G$ is indeed not provable;…

逻辑 · 数学 2019-07-02 Kaave Lajevardi , Saeed Salehi

We prove Euler's theorem of number theory developing an argument based on quandles. A quandle is an algebraic structure whose axioms mimic the three Reidemeister moves of knot theory.

组合数学 · 数学 2022-04-01 António Lages , Pedro Lopes

In the paper, we give the recurrent equations of the Hankel determinants of the Cantor sequence, and show that the Hankel determinants as a double sequence is 3-automatic. With the help of the Hankel determinants, we prove that the…

数论 · 数学 2014-11-12 Zhi-xiong Wen , Wen Wu

The article is devoted to the investigation of representation of rational numbers by Cantor series. Necessary and sufficient conditions for a rational number to be representable by a positive Cantor series are formulated for the case of an…

数论 · 数学 2019-04-23 Symon Serbenyuk

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

逻辑 · 数学 2021-11-30 Saeed Salehi

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…

计算机科学中的逻辑 · 计算机科学 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.

逻辑 · 数学 2009-05-19 René David , Marek Zaionc

The purpose of this paper is to provide a historical overview of some of the contemporary infinitesimalist alternatives to the Cantor-Dedekind theory of continua. Among the theories we will consider are those that emerge from nonstandard…

历史与综述 · 数学 2018-12-31 Philip Ehrlich

Cantor gave in his fundamental article an elegant proof of the countability of real algebraic numbers based on a positive integer height, denoted by him as N, of integer and irreducible polynomials of given degree (denoted by him as n) with…

数论 · 数学 2023-07-21 Wolfdieter Lang