English
Related papers

Related papers: Cantor versus Cantor

200 papers

The existence of higher derivative discontinuous solutions to a first order ordinary differential equation is shown to reveal a nonlinear SL(2,R) structure of analysis in the sense that a real variable $t$ can now accomplish changes not…

Classical Analysis and ODEs · Mathematics 2010-01-12 Dhurjati Prasad Datta

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

Logic in Computer Science · Computer Science 2024-05-24 Ludwig Staiger

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 --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…

History and Overview · Mathematics 2013-07-09 Zbigniew Nitecki

Given two coprime integers $p\ge 2$ and $q \ge 3$, let $D_p\subset[0,1)$ consist of all rational numbers which have a finite $p$-ary expansion, and let $$ K(q, \mathcal{A})=\bigg\{ \sum_{i=1}^\infty \frac{d_i}{q^i}: d_i\in \mathcal{A}~…

Number Theory · Mathematics 2024-06-05 Kan Jiang , Derong Kong , Wenxia Li , Zhiqiang Wang

We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to Martin-Lof random reals, identify a point with lower…

Computational Complexity · Computer Science 2021-02-09 Randall Dougherty , Jack Lutz , R. Daniel Mauldin , Jason Teutsch

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…

Logic in Computer Science · Computer Science 2023-04-12 Gilles Dowek , Ying Jiang

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

Functional Analysis · Mathematics 2016-10-26 Tomasz Kania , Tomasz Kochanek

Cantor's first set theory paper (1874) establishes the uncountability of $\mathbb{R}$. We study this most basic mathematical fact formulated in the language of higher-order arithmetic. In particular, we investigate the logical and…

Logic · Mathematics 2022-04-05 Dag Normann , Sam Sanders

We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…

Logic in Computer Science · Computer Science 2025-04-16 Thomas Ehrhard , Aymeric Walch

The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown to be ExpSpace-complete. We consider two extensions of this logic. We show that adding either additional binary…

Logic in Computer Science · Computer Science 2016-11-28 Bartosz Bednarczyk , Witold Charatonik , Emanuel Kieroński

Contrary to popular misconception, the question in the title is far from simple. It involves sets of numbers on the first level, sets of sets of numbers on the second level, and so on, endlessly. The infinite hierarchy of the levels…

Logic · Mathematics 2019-09-26 Boris Tsirelson

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

Discrete Mathematics · Computer Science 2011-08-30 Pierre-Yves Angrand , Jacques Sakarovitch

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…

Probability · Mathematics 2010-12-10 Gert de Cooman , Erik Quaeghebeur

From a transfer formula in multivariate finite operator calculus, comes an expansion for the determinant similar to Ryser's formula for the permanent. Although this one contains many more terms than the usual determinant formula. To prove…

Combinatorics · Mathematics 2015-09-15 Erik Insko , Katie Johnson , Shaun Sullivan

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler

On the real numbers, the notions of a semi-decidable relation and that of an effectively enumerable relation differ. The second only seems to be adequate to express, in an algorithmic way, non deterministic physical theories, where…

Logic in Computer Science · Computer Science 2023-05-03 Gilles Dowek

It is well known that all numbers that are normal of order $k$ in base $b$ are also normal of all orders less than $k$. Another basic fact is that every real number is normal in base $b$ if and only if it is simply normal in base $b^k$ for…

Number Theory · Mathematics 2014-07-23 Brian Li , Bill Mance

This study describes such a situation that a Cantor set emerges as a result of the exploration of sufficient conditions for the property which is generalized from fundamental chaotic maps, and the Cantor set even guarantees infinitely many…

Chaotic Dynamics · Physics 2015-03-18 Yoshihito Ogasawara , Shin'ichi Oishi

The paper adresses the problem of reasoning with ambiguities. Semantic representations are presented that leave scope relations between quantifiers and/or other operators unspecified. Truth conditions are provided for these representations…

cmp-lg · Computer Science 2008-02-03 Uwe Reyle
‹ Prev 1 8 9 10 Next ›