Check nearby libraries
Buy this book
"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"--
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
A framework for priority arguments
2010, Cambridge University Press
in English
0521119693 9780521119696
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references and index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?August 2, 2020 | Edited by ImportBot | import existing book |
May 1, 2010 | Created by WorkBot | work found |