Udvidet returret til d. 31. januar 2025

Algebraic Computability and Enumeration Models

- Recursion Theory and Descriptive Complexity

Bag om Algebraic Computability and Enumeration Models

This book 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 descriptive complexity with recursive computability with admissible sets and urelements.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9781771882477
  • Indbinding:
  • Hardback
  • Sideantal:
  • 310
  • Udgivet:
  • 24. februar 2016
  • Størrelse:
  • 152x229x23 mm.
  • Vægt:
  • 544 g.
  • BLACK NOVEMBER
  Gratis fragt
Leveringstid: 8-11 hverdage
Forventet levering: 21. november 2024

Beskrivelse af Algebraic Computability and Enumeration Models

This book 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 descriptive complexity with recursive computability with admissible sets and urelements.

Brugerbedømmelser af Algebraic Computability and Enumeration Models



Find lignende bøger
Bogen Algebraic Computability and Enumeration Models findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.