Cargando…

Recursion theory for metamathematics /

This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathem...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Smullyan, Raymond M.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York : Oxford University Press, 1993.
Colección:Oxford logic guides ; 22.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 EBSCO_ocn228117254
003 OCoLC
005 20231017213018.0
006 m o d
007 cr cn|||||||||
008 930601s1993 nyu ob 001 0 eng d
040 |a Nz  |b eng  |e pn  |c UV0  |d OCLCQ  |d N$T  |d YDXCP  |d E7B  |d OCLCQ  |d DKDLA  |d OCLCQ  |d MERUC  |d OCLCO  |d OCLCQ  |d DEBSZ  |d OCLCQ  |d OCLCF  |d OCLCQ  |d AZK  |d OCLCQ  |d COCUF  |d AGLDB  |d CCO  |d MOR  |d PIFBR  |d OCLCQ  |d U3W  |d STF  |d WRM  |d OCLCQ  |d VTS  |d NRAMU  |d INT  |d VT2  |d OCLCQ  |d WYU  |d TKN  |d OCLCQ  |d REC  |d INARC  |d OCLCO  |d OCLCQ  |d SFB  |d OCLCQ  |d OCLCO 
019 |a 62334355  |a 191038488  |a 472744358  |a 646735649  |a 888509509  |a 961637203  |a 962597453 
020 |a 1423734548  |q (electronic bk.) 
020 |a 9781423734543  |q (electronic bk.) 
020 |a 1602566224 
020 |a 9781602566224 
020 |z 019508232X  |q (acid-free) 
029 0 |a NZ1  |b 12030580 
029 1 |a AU@  |b 000051588779 
029 1 |a AU@  |b 000053230376 
029 1 |a DEBBG  |b BV043143098 
029 1 |a DEBSZ  |b 379294095 
029 1 |a DEBSZ  |b 422299499 
035 |a (OCoLC)228117254  |z (OCoLC)62334355  |z (OCoLC)191038488  |z (OCoLC)472744358  |z (OCoLC)646735649  |z (OCoLC)888509509  |z (OCoLC)961637203  |z (OCoLC)962597453 
050 4 |a QA9.6  |b .S68 1993eb 
072 7 |a COM  |x 037000  |2 bisacsh 
082 0 4 |a 511.3/5  |2 22 
049 |a UAMI 
100 1 |a Smullyan, Raymond M. 
245 1 0 |a Recursion theory for metamathematics /  |c Raymond M. Smullyan. 
260 |a New York :  |b Oxford University Press,  |c 1993. 
300 |a 1 online resource (xiv, 163 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a data file 
490 1 |a Oxford logic guides ;  |v 22 
504 |a Includes bibliographical references (pages 159-160) and index. 
588 0 |a Print version record. 
505 0 |a 0 Prerequisites; I: Recursive Enumerability and Recursivity; II: Undecidability and Recursive Inseparability; III: Indexing; IV: Generative Sets and Creative Systems; V: Double Generativity and Complete Effective Inseparability; VI: Universal and Doubly Universal Systems; VII: Shepherdson Revisited; VIII: Recursion Theorems; IX: Symmetric and Double Recursion Theorems; X: Productivity and Double Productivity; XI: Three Special Topics; XII: Uniform Gödelization; References; Index. 
520 |a This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.℗¡ 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Recursion theory. 
650 0 |a Logic, Symbolic and mathematical. 
650 6 |a Théorie de la récursivité. 
650 6 |a Logique symbolique et mathématique. 
650 7 |a COMPUTERS  |x Machine Theory.  |2 bisacsh 
650 7 |a Logic, Symbolic and mathematical  |2 fast 
650 7 |a Recursion theory  |2 fast 
650 7 |a Récursivité, théorie de la.  |2 ram 
653 0 |a Mathematical logic 
776 0 8 |i Print version:  |a Smullyan, Raymond M.  |t Recursion theory for metamathematics.  |d New York : Oxford University Press, 1993  |w (DLC) 92040495 
830 0 |a Oxford logic guides ;  |v 22. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=143571  |z Texto completo 
936 |a BATCHLOAD 
938 |a Internet Archive  |b INAR  |n recursiontheoryf0000smul 
938 |a EBSCOhost  |b EBSC  |n 143571 
938 |a YBP Library Services  |b YANK  |n 2769041 
938 |a YBP Library Services  |b YANK  |n 2367194 
938 |a YBP Library Services  |b YANK  |n 2629654 
994 |a 92  |b IZTAP