A Framework for Priority Arguments
$61.00 ( ) USD
Part of Lecture Notes in Logic
- Author: Manuel Lerman, University of Connecticut
Adobe eBook Reader
Other available formats:
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
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.Read more
- Presents a new approach to priority argument proofs in computability theory using a framework
- Presents isolation of the general combinatorial properties used in priority arguments from the techniques special to particular theorems
- Offers a presentation of shorter proofs of standard computability-theoretic theorems at lower levels, all following the same pattern; a new and greatly simplified proof of a theorem whose proof uses priority arguments at all finite levels
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: May 2010
- format: Adobe eBook Reader
- isbn: 9780511740954
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
2. Systems of trees of strategies
3. Σ1 constructions
4. Δ2 constructions
5. µ2 constructions
6. Δ3 constructions
7. Σ3 constructions
8. Paths and links
10. Higher level constructions
11. Infinite systems of trees.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×