A FRAMEWORK FOR PRIORITY ARGUMENTS by Manuel Lerman ( 9780511750779 )

Item Details

Title:

A FRAMEWORK FOR PRIORITY ARGUMENTS

By:

Format:

Electronic book text

List price:	£102.00
We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10:

0511750773

ISBN 13:

9780511750779

Publisher:

CAMBRIDGE UNIVERSITY PRESS

Pub. date:

4 August, 2010

Series:

Lecture Notes in Logic 34

Description:

This book presents a unifying framework for using priority arguments to prove theorems in computability.

Synopsis:

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.

Publication:

Imprint:

Cambridge University Press (Virtual Publishing)

Returns:

Non-returnable

Some other items by this author:

A FRAMEWORK FOR PRIORITY ARGUMENTS (HB)

COMPUTABILITY THEORY AND ITS APPLICATIONS (PB)

DEGREES OF UNSOLVABILITY (HB)