Model-Theoretic Approach to Proof Theory
This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory.
In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Keton...
This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory.
In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Keton...
