04118nam 22007212 450 991082461380332120160422133626.01-139-89203-71-107-50349-31-139-02859-61-107-51647-11-107-01451-41-107-51376-61-107-49634-91-107-50615-8(CKB)3460000000129043(EBL)1543609(OCoLC)866440808(SSID)ssj0001156938(PQKBManifestationID)11632212(PQKBTitleCode)TC0001156938(PQKBWorkID)11201117(PQKB)10990912(UkCbUP)CR9781139028592(Au-PeEL)EBL1543609(CaPaEBR)ebr10812152(CaONFJC)MIL552441(MiAaPQ)EBC1543609(PPN)261332074(EXLCZ)99346000000012904320110221d2013|||| uy| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierEffective mathematics of the uncountable /edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York[electronic resource]Cambridge :Cambridge University Press,2013.1 online resource (viii, 197 pages) digital, PDF file(s)Lecture notes in logic ;41Title from publisher's bibliographic system (viewed on 05 Oct 2015).1-306-21190-5 1-107-52118-1 Includes bibliographical references.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.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.Lecture notes in logic ;41.Model theoryComputable functionsModel theory.Computable functions.511.3/4Greenberg Noam1974-Hamkins Joel DavidHirschfeldt Denis RomanMiller Russell(Professor of mathematics),Association for Symbolic Logic,UkCbUPUkCbUPBOOK9910824613803321Effective mathematics of the uncountable4127970UNINA01506nam0 22002771i 450 UON0018107820231205103132.19620030730d1986 |0itac50 baengUS|||| 1||||Containmentconcept and policyedited by Terry L. DeibelJohn Lewis Gaddi s WashingtonNational Defense University Press1986 - 2 v. ; 25 cmBas ed on a Symposium cosponsored by the National Defense University and the Foreign Service InstituteStati UnitiPolitica estera1945UONC035414FISTATI UNITIRelazioni internazionaliUONC036544FIDeibelTerry L.UONV104087GADDISJohn LewisUONV104088ITSOL20251003RICAUON00181078SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI A 1380 SI SC 1878 5 1380 SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI A 1380 SI SC 18781 5 1380 SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI A 1380 SI SC 20970 5 1380 SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI A 1380 SI SC 20971 5 1380 Containment1289474UNIOR