Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles
Book information
Description
This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.
Similar books
Forcing, Iterated Ultrapowers, and Turing Degrees
2015 · PDF
E-Recursion, Forcing and C*-Algebras
2014 · PDF
Notes on Forcing Axioms
2014 · PDF
Infinity and truth
2014 · PDF
Infinity and Truth
2014 · PDF
Computational Prospects of Infinity II: Presented Talks (Lecture Notes Series, Institute for Mathematical Sciences, N)
2008 · PDF
Computational Prospects of Infinity, Part I: Tutorials: Tutorials Pt. I
2008 · PDF
Computational prospects of infinity. Part II: Presented talks
2008 · PDF