2016/10/13 by Dmytro Taranovsky, Taranovsky, Dmytro
Computer Science · Mathematics · #03E10 (secondary) #03F15 (primary) #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1610.04633
openalex publication_date 2016/10/13 · openalex created_date 2022/08/29 · openalex updated_date 2026/07/28
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured strength beyond second order arithmetic (and plausibly beyond ZFC), and prove well-foundedness for some weakened versions.