| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
in00005652921 |
| 006 |
m o d |
| 007 |
cr cn||||||||| |
| 008 |
160506t20162016flu ob 001 0 eng d |
| 005 |
20250728184632.8 |
| 035 |
|
|
|a (OCoLC)ocn949226660
|
| 040 |
|
|
|a CRCPR
|b eng
|e rda
|e pn
|c CRCPR
|d OCLCO
|d OCLCF
|d OCLCQ
|d UAB
|d EBLCP
|d UUM
|d OCLCQ
|d U3W
|d UWO
|d TYFRS
|d LEAUB
|d OCLCQ
|d OCLCO
|d K6U
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 020 |
|
|
|a 9781771882484
|q (e-book ;
|q PDF)
|
| 020 |
|
|
|a 1771882484
|q (e-book ;
|q PDF)
|
| 035 |
|
|
|a (OCoLC)949226660
|
| 050 |
|
4 |
|a QA169
|b .N68 2016
|
| 082 |
0 |
4 |
|a 511.35
|b N931
|
| 049 |
|
|
|a TXAM
|
| 100 |
1 |
|
|a Nourani, Cyrus F.,
|e author.
|
| 245 |
1 |
0 |
|a Algebraic computability and enumeration models :
|b recursion theory and descriptive complexity /
|c Cyrus F. Nourani, PhD.
|
| 264 |
|
1 |
|a Boca Raton :
|b CRC Press,
|c [2016]
|
| 264 |
|
4 |
|c ©2016
|
| 300 |
|
|
|a 1 online resource :
|b text file, PDF
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 505 |
0 |
|
|a 1. Introduction -- 2. Computing categories, language fragments, and models -- 3. Functorial admissible models -- 4. Initial tree computing and languages -- 5. Descriptive sets and infinitary languages -- 6. Complexity and computing -- 7. Arithmetic hierarchy and enumeration degrees -- 8. Peano arithmetic models and computability -- 9. Realizability and computability.
|
| 520 |
|
|
|a This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. 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 also introduced to explain descri.
|
| 650 |
|
0 |
|a Functor theory.
|
| 650 |
|
0 |
|a Model theory.
|
| 650 |
|
0 |
|a Computable functions.
|
| 650 |
|
0 |
|a Algebra, Homological.
|
| 650 |
|
0 |
|a Kleene algebra.
|
| 650 |
|
6 |
|a Théorie des foncteurs.
|
| 650 |
|
6 |
|a Théorie des modèles.
|
| 650 |
|
6 |
|a Fonctions calculables.
|
| 650 |
|
6 |
|a Algèbre homologique.
|
| 650 |
|
6 |
|a Algèbre de Kleene.
|
| 650 |
|
7 |
|a Algebra, Homological
|2 fast
|
| 650 |
|
7 |
|a Computable functions
|2 fast
|
| 650 |
|
7 |
|a Functor theory
|2 fast
|
| 650 |
|
7 |
|a Kleene algebra
|2 fast
|
| 650 |
|
7 |
|a Model theory
|2 fast
|
| 655 |
|
7 |
|a Electronic books.
|2 local
|
| 710 |
2 |
|
|a Taylor & Francis.
|
| 758 |
|
|
|i has work:
|a Algebraic computability and enumeration models (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGHrktVBpYFx8KvhFY7XQy
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|z 9781771882477
|
| 856 |
4 |
0 |
|u http://proxy.library.tamu.edu/login?url=https://www.taylorfrancis.com/books/9780429154720
|z Connect to the full text of this electronic book
|t 0
|
| 936 |
|
|
|a BATCHLOAD
|
| 955 |
|
|
|a Taylor and Francis MATHnetBASE
|
| 994 |
|
|
|a 92
|b TXA
|
| 999 |
f |
f |
|s ad8ff6da-a4c5-425c-8242-8010784a95ef
|i 66cf1774-a2ae-4d20-89e8-001aae4b4c16
|t 0
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|d Available Online
|t 0
|e QA169 .N68 2016
|h Library of Congress classification
|
| 998 |
f |
f |
|a QA169 .N68 2016
|t 0
|l Available Online
|