The game metatheorem
Abstract
The game metatheorem was recently developed by the author to simplify various constructions in computable structure theory that involve zero-to-the-alpha priority arguments for transfinite alpha. It is a powerful tool, that allows the user to produce proves without worrying about the inctricate combinatorics of approximations to Sigma-alpha sets.
Fields of Study & Subjects
Computability
Logic
AI Algorithms
Advanced Topology and Set Theory
programming
and type systems
Publication details
- Journal / source
- Cambridge University Press eBooks
- Pages
- 125–136
- Publication date
- 30 January 2026
- Document type
- Book chapter