Related papers: Constructive Limits of Cantor's Diagonal Method: C…
We propose a new constructive model of the real continuum based on the notion of fractal definability. Rather than assuming the continuum as a completed uncountable totality, we view it as the cumulative result of a vast space of stratified…
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…
Whatever other beliefs there may remain for considering Cantor's diagonal argument as mathematically legitimate, there are three that, prima facie, lend it an illusory legitimacy; they need to be explicitly discounted appropriately. The…
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…
Georg Cantor was the genuine discoverer of the Mathematical Infinity, and whatever he claimed, suggested, or even surmised should be taken seriously -- albeit not necessary at its face value. Because alongside his exquisite in beauty…
The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…
We give an analysis over a variation of causal sets where the light cone of an event is represented by finitely branching trees with respect to any given arbitrary dynamics. We argue through basic topological properties of Cantor space that…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
The diagonal method is often used to show that Turing machines cannot solve their own halting problem. There have been several recent attempts to show that this method also exposes either contradiction or arbitrariness in other theoretical…
Representing real numbers using convenient numeration systems (integer bases, $\beta$-numeration, Cantor bases, etc.) has been a longstanding mathematical challenge. This paper focuses on Cantor real bases and, specifically, on automatic…
This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its row-words. The permanent Perm(T) is the set of words…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
For any analytically finite Riemann surface, the Teichm\"uller modular group is countable, but it is not easy to find an analytically infinite Riemann surface for which the Teichm\"uller modular group is countable. In this paper, we show…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
A common question from students on the usual diagonalization proof for the uncountability of the set of real numbers is: when a representation of real numbers, such as the decimal expansions of real numbers, allows us to use the…
The Hausdorff-Alexandroff Theorem states that any compact metric space is the continuous image of Cantor's ternary set $C$. It is well known that there are compact Hausdorff spaces of cardinality equal to that of $C$ that are not continuous…
We consider heavy-tailed observables maximised on a dynamically defined Cantor set and prove convergence of the associated point processes as well as functional limit theorems. The Cantor structure, and its connection to the dynamics,…
This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…