Skip to content
Cart 
Register Sign in Wishlist

A Framework for Priority Arguments

AUD$65.96 inc GST

List price AUD$87.95
Save AUD$21.99

Use discount code: F1ASL

Part of Lecture Notes in Logic

  • Date Published: April 2010
  • availability: Available
  • format: Hardback
  • isbn: 9780521119696

AUD$ 65.96 inc GST
Hardback

List price AUD$87.95
Save AUD$21.99

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • 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
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2010
    • format: Hardback
    • isbn: 9780521119696
    • length: 192 pages
    • dimensions: 235 x 158 x 15 mm
    • weight: 0.38kg
    • availability: Available
  • Table of Contents

    1. Introduction
    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
    9. Backtracking
    10. Higher level constructions
    11. Infinite systems of trees.

  • Author

    Manuel Lerman, University of Connecticut
    Manuel Lerman is a Professor Emeritus of the Department of Mathematics at the University of Connecticut. He is the author of Degrees of Unsolvability: Local and Global Theory, has been the managing editor for the book series Perspectives in Mathematical Logic, has been an editor of Bulletin for Symbolic Logic, and is an editor of the ASL's Lecture Notes in Logic series.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

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 ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×