The Leading eBooks Store Online
for your Apple or Android device, Nook, Kobo, PC, Mac, Sony Reader...
A Framework for Priority Arguments
Add to cart
US$ 64.00
(+ tax)
Preview (read now)
Add to my own site
Buy multiple copies
Give this ebook to a friend
Add to my wishlist
Author's page
Publisher's page
Devices
- iPad
- PC
- e-readers with Adobe Digital Editions installed
- Mac
See the full list
Available Devices
X
This book is available for the following devices:
- iPad
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
File Formats
Download: PDF.
You can also read this book online in eb20 format without having to download anything.
You can also read this book online in eb20 format without having to download anything.
Permissions
Printing
Copy/Paste
Read Aloud
Printing
Copy/Paste
Read Aloud
more
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.
Cambridge University Press; April 2010
194 pages; ISBN 9780511740954
Read online, or download in secure PDF format
194 pages; ISBN 9780511740954
Read online, or download in secure PDF format