skip to content
Algebraic computability and enumeration models : recursion theory and descriptive complexity Preview this item
ClosePreview this item
Checking...

Algebraic computability and enumeration models : recursion theory and descriptive complexity

Author: Cyrus F Nourani
Publisher: Toronto : Apple Academic Press, 2016.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
"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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Nourani, Cyrus F.
Algebraic computability and enumeration models.
Toronto : Apple Academic Press, 2016
(DLC) 2016000519
Document Type: Book
All Authors / Contributors: Cyrus F Nourani
ISBN: 9781771882477 1771882476
OCLC Number: 932093597
Notes: Includes index.
Description: xiv, 295 pages ; 24 cm
Contents: Introduction --
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.
Responsibility: Cyrus F. Nourani, PhD.

Abstract:

"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."--

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/932093597> # Algebraic computability and enumeration models : recursion theory and descriptive complexity
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "932093597" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/onc> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/model_theory> ; # Model theory
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_descriptive_des_ensembles> ; # Théorie descriptive des ensembles
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/fonctions_calculables> ; # Fonctions calculables
    schema:about <http://dewey.info/class/511.35/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_des_modeles> ; # Théorie des modèles
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/kleene_algebra> ; # Kleene algebra
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/computable_functions> ; # Computable functions
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/algebra_homological> ; # Algebra, Homological
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/informatique_mathematiques> ; # Informatique--Mathématiques
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_des_foncteurs> ; # Théorie des foncteurs
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/complexite_de_calcul_informatique> ; # Complexité de calcul (Informatique)
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_de_la_recursivite> ; # Théorie de la récursivité
    schema:about <http://experiment.worldcat.org/entity/work/data/2833856957#Topic/functor_theory> ; # Functor theory
    schema:bookFormat bgn:PrintBook ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/2833856957#Person/nourani_cyrus_f> ; # Cyrus F. Nourani
    schema:datePublished "2016" ;
    schema:description ""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."--"@en ;
    schema:description "Introduction -- 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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/2833856957> ;
    schema:inLanguage "en" ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/2833856957#CreativeWork/algebraic_computability_and_enumeration_models> ;
    schema:name "Algebraic computability and enumeration models : recursion theory and descriptive complexity"@en ;
    schema:productID "932093597" ;
    schema:workExample <http://worldcat.org/isbn/9781771882477> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/932093597> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/2833856957#Person/nourani_cyrus_f> # Cyrus F. Nourani
    a schema:Person ;
    schema:familyName "Nourani" ;
    schema:givenName "Cyrus F." ;
    schema:name "Cyrus F. Nourani" ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/algebra_homological> # Algebra, Homological
    a schema:Intangible ;
    schema:name "Algebra, Homological"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/complexite_de_calcul_informatique> # Complexité de calcul (Informatique)
    a schema:Intangible ;
    schema:name "Complexité de calcul (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/computable_functions> # Computable functions
    a schema:Intangible ;
    schema:name "Computable functions"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/fonctions_calculables> # Fonctions calculables
    a schema:Intangible ;
    schema:name "Fonctions calculables"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/informatique_mathematiques> # Informatique--Mathématiques
    a schema:Intangible ;
    schema:name "Informatique--Mathématiques"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_de_la_recursivite> # Théorie de la récursivité
    a schema:Intangible ;
    schema:name "Théorie de la récursivité"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_des_foncteurs> # Théorie des foncteurs
    a schema:Intangible ;
    schema:name "Théorie des foncteurs"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_des_modeles> # Théorie des modèles
    a schema:Intangible ;
    schema:name "Théorie des modèles"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/2833856957#Topic/theorie_descriptive_des_ensembles> # Théorie descriptive des ensembles
    a schema:Intangible ;
    schema:name "Théorie descriptive des ensembles"@fr ;
    .

<http://worldcat.org/entity/work/data/2833856957#CreativeWork/algebraic_computability_and_enumeration_models>
    a schema:CreativeWork ;
    rdfs:label "Algebraic computability and enumeration models." ;
    schema:description "Online version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/932093597> ; # Algebraic computability and enumeration models : recursion theory and descriptive complexity
    .

<http://worldcat.org/isbn/9781771882477>
    a schema:ProductModel ;
    schema:isbn "1771882476" ;
    schema:isbn "9781771882477" ;
    .

<http://www.worldcat.org/title/-/oclc/932093597>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/932093597> ; # Algebraic computability and enumeration models : recursion theory and descriptive complexity
    schema:dateModified "2018-11-13" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.