A Framework for Priority Arguments
Manuel Lerman
Year: 2010
ISBN-13: 9780521119696
192 pages. Hardcover.
Buy Now (when ordering, include the discount code ASL2016 to receive the 25% ASL member discount)
This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate the framework’s use, with all proofs following the same pattern. The last section features a new example requiring priority at all finite levels. The book will serve as a resource and reference for researchers in logic and computability, helping them to prove theorems in a shorter and more transparent manner.
Table of Contents
- Preface
- Introduction
- Systems of Trees of Strategies
- Σ1 Constructions
- Δ2 Constructions
- Π2 Constructions
- Δ3 Constructions
- Σ3 Constructions
- Paths and Links
- Backtracking
- Higher-Level Constructions
- Infinite Systems of Trees