2025/03/25 by Semenov, Stanislav
#03B70 #03D80 #03E10 #F.4.1 #FOS: Mathematics #General Mathematics (math.GM)
paper · doi:10.48550/arxiv.2503.20095
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 -- effectively generates only countable fragments within a closed formal system. We formalize this limitation as the "fractal boundary of constructivity", the asymptotic limit of all constructive extensions under syntactically enumerable rules. A central theorem establishes the impossibility of fully capturing the structure of the continuum within any such system. We further introduce the concept of "fractal countability", a process-relative refinement of countability based on layered constructive closure. This provides a framework for analyzing definability beyond classical recursion without invoking uncountable totalities. We interpret the continuum not as an object constructively realizable, but as a horizon of formal expressibility.