Cover Image

Fractal Analysis on the Real Interval: A Constructive Approach via Fractal Countability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Semenov, Stanislav
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Functional Analysis 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

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

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

On the Nature of Fractal Numbers and the Classical Continuum Hypothesis (CH)
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 Boundaries of Constructivity: A Meta-Theoretical Critique of Countability and 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)

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

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

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

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

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

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

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

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

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

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
by: Cerda, Rémy, et al.
Published: (2022)

Cut elimination for propositional cyclic proof systems with fixed-point operators
by: Hori, Hiromasa, et al.
Published: (2023)

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

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

Forcing with Language Fragments, Extending Namba Forcing, and Models of Theories with Constraints in Interpretation
by: Lau, Desmond
Published: (2024)

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

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

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

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

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

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

Rough sets semantics for the three-valued extension of first-order Priest's da Costa logic
by: Castiglioni, José Luis, et al.
Published: (2025)

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

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)

Reasoning Around Paradox with Grounded Deduction
by: Ford, Bryan
Published: (2024)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

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

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

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

How to play the Accordion: Uniformity and the (non-)conservativity of the linear approximation of the λ-calculus (extended version)
by: Cerda, Rémy, et al.
Published: (2023)

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

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

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