Books

> Lecture Notes in Logic
   Perspectives in Logic

   Other ASL Books

   Member Discounts

  


Available LNL volumes

 Ordering

 Editorial Policies

 Submission information

 Editorial Board

 

 

 

 

 

 

 

 

 

 

 

 

A Framework for Priority Arguments

 

Manuel Lerman

 

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.

Year: 2010
Price:$75.00 ISBN-13: 9780521119696
192 pages. Hardcover.
BUY NOW
(when ordering, include the discount code ASL2016 to receive the 25% ASL member discount)

Table of Contents

Preface

Chapter 1. Introduction
Chapter 2. Systems of Trees of Strategies
Chapter 3. Σ1 Constructions
Chapter 4. Δ2 Constructions
Chapter 5. Π2 Constructions
Chapter 6. Δ3 Constructions
Chapter 7. Σ3 Constructions
Chapter 8. Paths and Links
Chapter 9. Backtracking
Chapter 10. Higher-Level Constructions
Chapter 11. Infinite Systems of Trees





<Back to LNL titles listing




 

 


[ Meetings | Announcements | Membership | Journals | ASL Books | Links to Other Sites | ASL Info | Home]