• Produktbild: Algebraic Computability and Enumeration Models
  • Produktbild: Algebraic Computability and Enumeration Models

Algebraic Computability and Enumeration Models Recursion Theory and Descriptive Complexity

121,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

31.03.2021

Verlag

Apple Academic Press

Seitenzahl

310

Maße (L/B/H)

22,9/15,2/1,7 cm

Gewicht

452 g

Sprache

Englisch

ISBN

978-1-77463-575-9

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

31.03.2021

Verlag

Apple Academic Press

Seitenzahl

310

Maße (L/B/H)

22,9/15,2/1,7 cm

Gewicht

452 g

Sprache

Englisch

ISBN

978-1-77463-575-9

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Kundinnen und Kunden meinen

0 Bewertungen

Informationen zu Bewertungen

Zur Abgabe einer Bewertung ist eine Anmeldung im Konto notwendig. Die Authentizität der Bewertungen wird von uns nicht überprüft. Wir behalten uns vor, Bewertungstexte, die unseren Richtlinien widersprechen, entsprechend zu kürzen oder zu löschen.

Die Bewertungen sind nach Format, Anzahl Sterne und Datum sortiert.

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kund*innen durch Ihre Meinung

Kundinnen und Kunden meinen

0 Bewertungen filtern

  • Produktbild: Algebraic Computability and Enumeration Models
  • Produktbild: Algebraic Computability and Enumeration Models
  • PrefaceIntroductionComputing Categories, Language Fragments, and ModelsIntroductionLimits and Infinitary LanguagesGeneric Functors and Language String ModelsPositive Generic ModelsFragment Consistent AlgebrasGeneric ProductsPositive Morphisms and ModelsPositive Consistency and Omitting TypesPositive Fragment Consistency ModelsHorn ModelsPositive Categories and Horn FragmentsFragment Consistent Kleene ModelsMore on Kleene StructuresProcess AlgebrasFunctorial Admissible ModelsInfinitary Languages BasicsAdmissible LanguagesAdmissible ModelsInfinite Language CategoriesA Descriptive ComputingComputing Model DiagramsSituations and CompatibilityBoolean Computing DiagramsDescription LogicFunctorial Model Theory and HIFI ComputingGeneric Functor Initial ModelsInitial Tree Algebras and AmplificationTree Amplifiers and The Sonic BoomsThe Recursion TheoremTree Amplifiers and RecursionAdmissible Gain SynthesizerInitial Tree Computing and LanguagesInitial Models and Their Algebraic FormulationThe BasicsCanonical ModelsGeneric diagrams of Initial ModelsInitial Algebras and Computable TreesTree Rewriting, Algebras, and Infinitary ModelsAre There Models for NothingFree Proof Trees and Computing Models Generating Models by Positive ForcingAlgebraically Closed GroupsWord Problems and the SRS Roller CoasterThe Roller CoasterPrivate Languages and Wittgenstein’s ParadoxConcluding CommentsDescriptive Sets and Infinitary LanguagesIntroductionAdmissible Sets and StructuresBasic Descriptive CharacterizationsBoolean Valued ModelsAdmissible Sets and Ordinals Error! Bookmark not defined.Set ReducibilityAdmissible Tree RecursionAdmissible Set ReducibilityComplexity and ComputingIntroductionForcing, Complexity, and Diaphontine DefinabilityTechnical PreliminariesInitial Models Generic Diagrams for Initial ModelsModels and Fragment Inductive ClosurePositive Forcing and Infinitary ModelsGenerating Models by Positive ForcingForcing and ComputabilityComplexity Classes, Models, and UrlementsFunctorial Implicit Complexity Error! Bookmark not defined.Abstract Descriptive ComplexityA Descriptive Computing Example RevisitRudiments, KPU, and RecursionAdmissible HullsConcrete Descriptive ComplexityConcrete Implicit ComplexityOverview to Arithmetic HierarchyArithmetic Hierarchy and Enumeration DegreesIntroductionTuring Degrees and Isomorphism TypesArithmetic Hierarchy and Infinitary LanguagesComputability and Hierarchy with Infinitary LanguagesComputability on Infinitary LanguagesEnumeration DegreesEnumeration Definability and Turing JumpsAutomorphisms and Lifts on K-PairsEnumeration Computability ModelsRudiments, KPU, and RecursionComputable Categorical TreesEnumerations Model TheoryPeano Arithmetic Models and ComputabilityIntroductionRecursion on Arithmetic FragmentsGodel’s Incompleteness and Ordinal ArithmeticDescriptive Sets and AutomataFinite ModelsFields and Fragments of Peano ArithmeticArithmetic Hierarchy and Borel SetsInfinitary Theories and c=Countable N ModelsKPU Ordinal ModelsGeneric Computability and FiltersRealizability and ComputabilityIntroductionCategorical Models and RealizabilityCategorical Intuitionistic ModelsInfinitary Language Product ModelsPositive Generic ModelsOmitting Types RealizabilityPositive Realizability Morphisms and ModelsFragment Product Algebra RealizabilityPositive Realizability on Horn FiltersComputability and Positive RealizabilityMorphic Realization FunctorsPositive Categories and Consistency ModelsHorn Computability and RealizabilityIntuitionistic Types and RealizabilityRealizability on UltrafiltersComputing Morphisms on ToposRelative Realizability on ToposRealizability TriposesMore on Topos RealizabilityOn PreSheaves Topos RealizabilityIndex