Cargando…

Effective mathematics of the uncountable /

Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods - some old, some new - that have extended its basic concepts to uncountable structures. Unlike in the classical case, however, no single dominant approach has emerged, and differ...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Greenberg, Noam, 1974- (Autor, Editor ), Hamkins, Joel David (Autor, Editor ), Miller, Russell (Professor of mathematics) (Autor, Editor )
Otros Autores: Hirschfeldt, Denis Roman (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: [Ithaca, NY?] : Cambridge : Association for Symbolic Logic ; Cambridge University Press, 2013.
Colección:Lecture notes in logic ; 41.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Ii 4500
001 EBSCO_ocn865081984
003 OCoLC
005 20231017213018.0
006 m o d
007 cr mn|||||||||
008 131212s2013 nyua ob 000 0 eng d
040 |a CAMBR  |b eng  |e rda  |e pn  |c CAMBR  |d YDXCP  |d IDEBK  |d CAMBR  |d UMI  |d OSU  |d N$T  |d COO  |d DEBBG  |d DEBSZ  |d OCLCQ  |d OCLCO  |d OCLCF  |d VT2  |d UIU  |d OCLCQ  |d NJR  |d OCLCQ  |d CEF  |d WYU  |d UKAHL  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCO 
019 |a 869478952  |a 869546259 
020 |a 9781139028592  |q (electronic bk.) 
020 |a 1139028596  |q (electronic bk.) 
020 |a 9781461953678  |q (electronic bk.) 
020 |a 1461953677  |q (electronic bk.) 
020 |a 9781107521186 
020 |a 1107521181 
020 |a 9781306211901 
020 |a 1306211905 
020 |z 9781107014510  |q (hardback) 
020 |z 1107014514  |q (hardback) 
029 1 |a DEBBG  |b BV041778452 
029 1 |a DEBSZ  |b 404329411 
029 1 |a GBVCP  |b 882723286 
029 1 |a NLGGC  |b 373032986 
035 |a (OCoLC)865081984  |z (OCoLC)869478952  |z (OCoLC)869546259 
037 |a CL0500000363  |b Safari Books Online 
050 4 |a QA9.7  |b .E344 2013eb 
072 7 |a MAT  |x 000000  |2 bisacsh 
082 0 4 |a 511.3/4  |2 23 
049 |a UAMI 
245 0 0 |a Effective mathematics of the uncountable /  |c edited by Noam Greenberg, Denis Hirschfeldt, Joel David Hamkins, Russell Miller. 
264 1 |a [Ithaca, NY?] :  |b Association for Symbolic Logic ;  |a Cambridge :  |b Cambridge University Press,  |c 2013. 
300 |a 1 online resource (viii, 197 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 41 
504 |a Includes bibliographical references. 
505 0 |a Some results on R-computable structures / Wesley Calvert and John E. Porter -- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals / Samuel Coskey and Joel David Hamkins -- Computable structure theory using admissible recursion theory on [omega]1 using admissibility / Noam Greenberg and Julia F. Knight -- Local computability and uncountable structures / Russell Miller -- Borel structures : a brief survey / Antonio Montalbán and André Nies -- E-recursive intuitions / Gerald E. Sacks -- Reverse mathematics, countable and uncountable : a computational approach -- Effective model theory : an approach via [Sigma]-definability. 
588 0 |a Print version record. 
520 |a Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods - some old, some new - that have extended its basic concepts to uncountable structures. Unlike in the classical case, however, no single dominant approach has emerged, and different methods reveal different aspects of the computable content of uncountable mathematics. This book contains introductions to eight major approaches to computable uncountable mathematics: descriptive set theory; infinite time Turing machines; Blum-Shub-Smale computability; Sigma-definability; computability theory on admissible ordinals; E-recursion theory; local computability; and uncountable reverse mathematics. This book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages. It is ideal as both an introductory text for graduate and advanced undergraduate students, and a source of interesting new approaches for researchers in computability theory and related areas.--  |c Back cover. 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Model theory. 
650 0 |a Computable functions. 
650 6 |a Théorie des modèles. 
650 6 |a Fonctions calculables. 
650 7 |a MATHEMATICS  |x General.  |2 bisacsh 
650 7 |a Computable functions  |2 fast 
650 7 |a Model theory  |2 fast 
700 1 |a Greenberg, Noam,  |d 1974-  |e editor,  |e author. 
700 1 |a Hirschfeldt, Denis Roman,  |e editor. 
700 1 |a Hamkins, Joel David,  |e editor,  |e author. 
700 1 |a Miller, Russell  |c (Professor of mathematics),  |e editor,  |e author. 
776 0 8 |i Print version:  |t Effective mathematics of the uncountable.  |d Cambridge, United Kingdom : Cambridge University Press, 2013  |z 9781107014510  |w (OCoLC)865065496 
830 0 |a Lecture notes in logic ;  |v 41. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=644567  |z Texto completo 
938 |a Askews and Holts Library Services  |b ASKH  |n AH34205245 
938 |a Askews and Holts Library Services  |b ASKH  |n AH26385987 
938 |a EBSCOhost  |b EBSC  |n 644567 
938 |a ProQuest MyiLibrary Digital eBook Collection  |b IDEB  |n cis27068173 
938 |a YBP Library Services  |b YANK  |n 11408999 
994 |a 92  |b IZTAP