Cargando…

A framework for priority arguments /

"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 p...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Lerman, M. (Manuel), 1943-
Formato: Electrónico eBook
Idioma:Inglés
Publicado: [Ithaca, NY?] : Cambridge ; New York : Association for Symbolic Logic ; Cambridge University Press, ©2010.
Colección:Lecture notes in logic ; 34.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Ia 4500
001 EBSCO_ocn646068871
003 OCoLC
005 20231017213018.0
006 m o d
007 cr mnu---unuuu
008 100706s2010 nyua ob 000 0 eng d
040 |a N$T  |b eng  |e pn  |c N$T  |d OSU  |d E7B  |d CDX  |d OCLCQ  |d COO  |d OCLCQ  |d REDDC  |d OCLCQ  |d DEBSZ  |d OCLCQ  |d YDXCP  |d OCLCQ  |d OCLCF  |d OCLCQ  |d NJR  |d OCLCQ  |d K6U  |d SFB  |d OCLCO  |d OCLCQ  |d OCLCO 
019 |a 649913113  |a 658183067  |a 712991332 
020 |a 9780511750038  |q (electronic bk.) 
020 |a 051175003X  |q (electronic bk.) 
020 |a 9780511743481  |q (ebook) 
020 |a 0511743483  |q (ebook) 
020 |z 9780521119696  |q (hardback) 
020 |z 0521119693  |q (hardback) 
020 |a 9786612630774 
020 |a 6612630779 
024 8 |a 9786612630774 
029 1 |a CHNEW  |b 000622970 
029 1 |a DEBSZ  |b 372907865 
035 |a (OCoLC)646068871  |z (OCoLC)649913113  |z (OCoLC)658183067  |z (OCoLC)712991332 
037 |a 263077  |b MIL 
050 4 |a QA9.54  |b .L47 2010eb 
072 7 |a MAT  |x 016000  |2 bisacsh 
072 7 |a MAT  |x 018000  |2 bisacsh 
082 0 4 |a 511.3/6  |2 22 
049 |a UAMI 
100 1 |a Lerman, M.  |q (Manuel),  |d 1943- 
245 1 2 |a A framework for priority arguments /  |c Manuel Lerman. 
260 |a [Ithaca, NY?] :  |b Association for Symbolic Logic ;  |a Cambridge ;  |a New York :  |b Cambridge University Press,  |c ©2010. 
300 |a 1 online resource (xvi, 176 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture notes in logic ;  |v 34 
520 |a "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"--Provided by publisher. 
504 |a Includes bibliographical references (pages 175-176). 
588 0 |a Print version record. 
505 0 |a Cover; Half-title; Series-title; Title; Copyright; CONTENTS; PREFACE; Chapter 1 INTRODUCTION; Chapter 2 SYSTEMS OF TREES OF STRATEGIES; Chapter 3 sigma1 CONSTRUCTIONS; Chapter 4 delta2 CONSTRUCTIONS; Chapter 5 pi2 CONSTRUCTIONS; Chapter 6 delta3 CONSTRUCTIONS; Chapter 7 sigma3 CONSTRUCTIONS; Chapter 8 PATHS AND LINKS; Chapter 9 BACKTRACKING; Chapter 10 HIGHER-LEVEL CONSTRUCTIONS; Chapter 11 INFINITE SYSTEMS OF TREES; REFERENCES 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Proof theory. 
650 0 |a Priority (Philosophy) 
650 0 |a Logic, Symbolic and mathematical. 
650 6 |a Théorie de la preuve. 
650 6 |a Antériorité (Philosophie) 
650 6 |a Logique symbolique et mathématique. 
650 7 |a MATHEMATICS  |x Infinity.  |2 bisacsh 
650 7 |a MATHEMATICS  |x Logic.  |2 bisacsh 
650 7 |a Logic, Symbolic and mathematical  |2 fast 
650 7 |a Priority (Philosophy)  |2 fast 
650 7 |a Proof theory  |2 fast 
776 0 8 |i Print version:  |a Lerman, M. (Manuel), 1943-  |t Framework for priority arguments.  |d New York : Cambridge University Press, 2010  |z 9780521119696  |w (DLC) 2010005437  |w (OCoLC)537641159 
830 0 |a Lecture notes in logic ;  |v 34. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=320441  |z Texto completo 
938 |a Coutts Information Services  |b COUT  |n 13832097 
938 |a ebrary  |b EBRY  |n ebr10394729 
938 |a EBSCOhost  |b EBSC  |n 320441 
938 |a YBP Library Services  |b YANK  |n 3330888 
938 |a YBP Library Services  |b YANK  |n 3371106 
938 |a YBP Library Services  |b YANK  |n 3583499 
938 |a YBP Library Services  |b YANK  |n 3322658 
994 |a 92  |b IZTAP