A Framework for Priority Arguments (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Lecture Notes in Logic
Release date:	April 2010
First published:	April 2010
Authors:	Manuel Lerman
Dimensions:	235 x 158 x 15mm (L x W x T)
Format:	Hardcover
Pages:	192
ISBN-13:	978-0-521-11969-6
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > General Promotions
LSN:	0-521-11969-3
Barcode:	9780521119696

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!