MARC Record from marc_columbia

LEADER: 04843cam a22007218i 4500
001 15108766
005 20220611232229.0
006 m o d
007 cr |||||||||||
008 160106s2016 onc ob 001 0 eng
010 $a 2016000519
035 $a(OCoLC)ocn932093598
035 $a(NNC)15108766
040 $aDLC$beng$erda$epn$cDLC$dNLC$dOCLCO$dOCLCF$dOCL$dIDEBK$dN$T$dYDXCP$dCDX$dUIU$dOCLCQ$dNRC$dOCLCQ$dWYU$dYDX$dOCLCQ$dK6U$dOCLCO
015 $a20159083079$2can
016 $a(AMICUS)000044214651
019 $a940961499
020 $a9781771882484$q(electronic bk.)
020 $a1771882484$q(electronic bk.)
020 $z9781771882477$q(hardcover ;$qalk. paper)
035 $a(OCoLC)932093598$z(OCoLC)940961499
042 $apcc
050 10 $aQA169
055 0 $aQA76.9 M35$bN69 2016
072 7 $aMAT$x000000$2bisacsh
082 00 $a511.3/5$223
084 $acci1icc$2lacc
084 $acoll13$2lacc
049 $aZCUA
100 1 $aNourani, Cyrus F.
245 10 $aAlgebraic computability and enumeration models :$brecursion theory and descriptive complexity /$cCyrus F. Nourani, PhD.
263 $a1601
264 1 $aToronto :$bApple Academic Press,$c2016.
300 $a1 online resource
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
500 $aIncludes index.
505 0 $aIntroduction -- Computing categories, language fragments, and models -- Functorial admissible models -- Initial tree computing and languages -- Descriptive sets and infinitary languages -- Complexity and computing -- Arithmetic hierarchy and enumeration degrees -- Peano arithmetic models and computability -- Realizability and computability.
588 0 $aPrint version record and CIP data provided by publisher; resource not viewed.
504 $aIncludes bibliographical references and index.
520 $a"This book, Computability, Algebraic Trees, Enumeration Degree Models, and Applications, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic view point. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are introduced also to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability are presented with algebraic trees realizing intuitionistic types of models. New homotopy techniques developed in the author's volume on the functorial model theory are applicable to Martin Lof types of computations with model categories. Functorial computability, induction, and recursion are examined in view of the above, presenting new computability techniques with monad transformations and projective sets. This informative volume will give readers a complete new feel for models, computability, recursion sets, complexity, and realizability. This book pulls together functorial thoughts, models, computability, sets, recursion, arithmetic hierarchy, filters, with real tree computing areas, presented in a very intuitive manner for university teaching, with exercises for every chapter. The book will also prove valuable for faculty in computer science and mathematics."--$cProvided by publisher.
650 0 $aFunctor theory.
650 0 $aModel theory.
650 0 $aComputable functions.
650 0 $aAlgebra, Homological.
650 0 $aKleene algebra.
650 6 $aThéorie des foncteurs.
650 6 $aThéorie des modèles.
650 6 $aFonctions calculables.
650 6 $aAlgèbre homologique.
650 6 $aAlgèbre de Kleene.
650 7 $aMATHEMATICS$xGeneral.$2bisacsh
650 7 $aAlgebra, Homological.$2fast$0(OCoLC)fst00804927
650 7 $aComputable functions.$2fast$0(OCoLC)fst00871985
650 7 $aFunctor theory.$2fast$0(OCoLC)fst00936137
650 7 $aKleene algebra.$2fast$0(OCoLC)fst01749626
650 7 $aModel theory.$2fast$0(OCoLC)fst01024368
655 0 $aElectronic books.
655 4 $aElectronic books.
776 08 $iPrint version:$aNourani, Cyrus F.$tAlgebraic computability and enumeration models.$dToronto : Apple Academic Press, 2016$z9781771882477$w(DLC) 2015047105
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15108766$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS