Cover Image

On the Nature of Fractal Numbers and the Classical Continuum Hypothesis (CH)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Semenov, Stanislav
Format:	Preprint
Published:	2025
Subjects:	General Mathematics 03F60, 26E40, 03F03 F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fractal Origin of the Continuum: A Hypothesis on Process-Relative Definability
by: Semenov, Stanislav
Published: (2025)

Axiomatic Foundations of Fractal Analysis and Fractal Number Theory
by: Semenov, Stanislav
Published: (2025)

Wave Arithmetic: A Smooth Integral Representation of Number Theory
by: Semenov, Stanislav
Published: (2025)

Invariant Bridges Between Four Successive Points: A New Tool for Data Coding
by: Semenov, Stanislav
Published: (2025)

Fractal Analysis on the Real Interval: A Constructive Approach via Fractal Countability
by: Semenov, Stanislav
Published: (2025)

A Smooth Analytical Approximation of the Prime Characteristic Function
by: Semenov, Stanislav
Published: (2025)

Fractal Boundaries of Constructivity: A Meta-Theoretical Critique of Countability and Continuum
by: Semenov, Stanislav
Published: (2025)

Constructive Limits of Cantor's Diagonal Method: Countability, Enumerability, and the Impossibility of Exhausting the Continuum
by: Semenov, Stanislav
Published: (2025)

Fractal Countability as a Constructive Alternative to the Power Set of N: A Meta-Formal Approach to Stratified Definability
by: Semenov, Stanislav
Published: (2025)

Smooth Approximations of the Rounding Function
by: Semenov, Stanislav
Published: (2025)

Smooth Integer Encoding via Integral Balance
by: Semenov, Stanislav
Published: (2025)

Invariant-Based Cryptography
by: Semenov, Stanislav
Published: (2025)

Invariant-Based Cryptography: Toward a General Framework
by: Semenov, Stanislav
Published: (2025)

Non-Compact Proofs
by: Artemov, Sergei
Published: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
by: Artemov, Sergei
Published: (2025)

Serial Properties, Selector Proofs, and the Provability of Consistency
by: Artemov, Sergei
Published: (2024)

A Guide to Krivine Realizability for Set Theory
by: Matthews, Richard
Published: (2023)

Forcing as a Local Method of Accessing Small Extensions
by: Lau, Desmond
Published: (2024)

Consistent ultrafinitist logic
by: Gajda, Michał J.
Published: (2021)

The Category Dichotomy for Ideals
by: Dow, Alan, et al.
Published: (2025)

On first-order arithmetic truth
by: Boyce, Stephen
Published: (2011)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

Proof Compression via Subatomic Logic and Guarded Substitutions
by: Barrett, Victoria, et al.
Published: (2025)

Structural focalization
by: Simmons, Robert J.
Published: (2011)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

Learning Families of Algebraic Structures from Text
by: Bazhenov, Nikolay, et al.
Published: (2024)

Two strong undefinability results in inquisitive and team semantics
by: Barbero, Fausto
Published: (2024)

A formalization of Borel determinacy in Lean
by: Manthe, Sven
Published: (2025)

Internal Effectful Forcing in System T
by: Escardo, Martin H., et al.
Published: (2025)

Glivenko's theorems from an ecumenical perspective
by: Pereira, Luiz Carlos, et al.
Published: (2026)

Y is a least fixed point combinator
by: Helfer, Joseph
Published: (2025)

Thoughts on sub-Turing interactive computability
by: Japaridze, Giorgi
Published: (2024)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
Published: (2025)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

On the computational properties of ambivalent sets and functions
by: Normann, Dag, et al.
Published: (2026)

A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
by: Bodirsky, Manuel, et al.
Published: (2020)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

Generalizations of Dini's Theorem under Weakened Monotonicity Conditions
by: Khatiwada, Riwaj
Published: (2025)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

From Numbers to Container Strings
by: Visser, Albert
Published: (2024)