Iterated true-stage arguments
Abstract
Under the hood of the game metatheorem are the iterated true-stage systems. They proved a way of approximating Simga-alpha information in a way that is combinatorially clean. As an application we prove the tree-of-structures theorem, that requires the full power of an iterated true-stage system and cannot be proved with the game metatheorem.
Fields of Study & Subjects
Advanced Topology and Set Theory
Computability
Logic
AI Algorithms
Game Theory and Applications
Publication details
- Journal / source
- Cambridge University Press eBooks
- Pages
- 137–178
- Publication date
- 30 January 2026
- Document type
- Book chapter