Format:
1 Online-Ressource (xvi, 176 pages)
,
digital, PDF file(s)
ISBN:
9780511750779
Series Statement:
Lecture notes in logic 34
Content:
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
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Additional Edition:
ISBN 9780521119696
Additional Edition:
Print version ISBN 9780521119696
Additional Edition:
Erscheint auch als Druck-Ausgabe Lerman, Manuel, 1943 - A framework for priority arguments Cambridge [u.a.] : Cambridge University Press, 2010 ISBN 0521119693
Additional Edition:
ISBN 9780521119696
Language:
English
Subjects:
Computer Science
Keywords:
Beweistheorie
DOI:
10.1017/CBO9780511750779
