Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2503.22042 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916761348079616 |
|---|---|
| author | Semenov, Stanislav |
| author_facet | Semenov, Stanislav |
| contents | Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all subsets of N, nor can it capture the real line in full. In this paper, we propose fractal countability as a constructive alternative to the power set. Rather than treating countability as an absolute cardinal notion, we redefine it as a stratified, process-relative closure over definable subsets, generated by a sequence of conservative extensions to a base formal system. This yields a structured, internally growing hierarchy of constructive definability that remains within the countable realm but approximates the expressive richness of the continuum. We compare fractally countable sets to classical countability and the hyperarithmetical hierarchy, and interpret the continuum not as a completed object, but as a layered definitional horizon. This framework provides a constructive reinterpretation of power set-like operations without invoking non-effective principles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_22042 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fractal Countability as a Constructive Alternative to the Power Set of N: A Meta-Formal Approach to Stratified Definability Semenov, Stanislav General Mathematics 03D80, 03E10, 03B70 F.4.1 Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all subsets of N, nor can it capture the real line in full. In this paper, we propose fractal countability as a constructive alternative to the power set. Rather than treating countability as an absolute cardinal notion, we redefine it as a stratified, process-relative closure over definable subsets, generated by a sequence of conservative extensions to a base formal system. This yields a structured, internally growing hierarchy of constructive definability that remains within the countable realm but approximates the expressive richness of the continuum. We compare fractally countable sets to classical countability and the hyperarithmetical hierarchy, and interpret the continuum not as a completed object, but as a layered definitional horizon. This framework provides a constructive reinterpretation of power set-like operations without invoking non-effective principles. |
| title | Fractal Countability as a Constructive Alternative to the Power Set of N: A Meta-Formal Approach to Stratified Definability |
| topic | General Mathematics 03D80, 03E10, 03B70 F.4.1 |
| url | https://arxiv.org/abs/2503.22042 |