What question did this study set out to answer?

The research aims to establish a hierarchy of reflective theories based on a transfinite recursive structure with controlled branching.

January 24, 2026Open Access

Transfinite Recursive Trees with Controlled Branching: Π₁¹-Completeness and Stratification by Branching Width

Read Full Paperexternally

Key Points

The research aims to establish a hierarchy of reflective theories based on a transfinite recursive structure with controlled branching.
Constructed a transfinite hierarchy indexed by a binary tree with controlled branching.
Analyzed the completeness of infinite paths through the tree via maximum branching degree restrictions.
Introduced an operator that adds consistency and a full reflection scheme.
Demonstrated that the set of infinite paths is Π₁¹-complete.
Established a strict hierarchy from Π₁⁰-complete to Π₁¹-complete sets based on branching degree.
Showed that the Higher Set of Undecidable Types is Π₁¹-complete, reflecting absolute silence in mathematical foundations.

Abstract

We construct an explicit transfinite hierarchy of reflective theories indexed by a binary tree with controlled branching. We show that the set of infinite paths through this tree is Π₁¹-complete, while its restrictions by maximum branching degree form a strict hierarchy from Π₁⁰-complete to Π₁¹-complete sets. The construction is based on an operator that simultaneously adds both a consistency statement and a full reflection scheme. As a corollary, we obtain that the set of sentences independent of all theories in the hierarchy (called the Higher Set of Undecidable Types, HSUT) is also Π₁¹-complete, formalizing the notion of "absolute silence" in the foundations of mathematics.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Authors

Daniel Osipenkov

Smolensk State University

Actions

Institutions

Smolensk State University

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Transfinite Recursive Trees with Controlled Branching: Π₁¹-Completeness and Stratification by Branching Width

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Authors

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Also consider