Del i serien Lecture Notes in Pure and Applied Mathematics

Mathematical Logic and Theoretical Computer Science

Inbunden, Engelska, 2017

AvDavid Kueker

3 569 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

5 089 kr

Skickas inom 10-15 vardagar

Mathematical Logic and Theoretical Computer Science covers various topics ranging from recursion theory to Zariski topoi. Leading international authorities discuss selected topics in a number of areas, including denotational semanitcs, reccuriosn theoretic aspects fo computer science, model theory and algebra, Automath and automated reasoning, stability theory, topoi and mathematics, and topoi and logic.The most up-to-date review available in its field, Mathematical Logic and Theoretical Computer Science will be of interest to mathematical logicians, computer scientists, algebraists, algebraic geometers, differential geometers, differential topologists, and graduate students in mathematics and computer science.

Produktinformation

Utgivningsdatum2017-11-06
Mått178 x 254 x 33 mm
Vikt910 g
FormatInbunden
SpråkEngelska
SerieLecture Notes in Pure and Applied Mathematics
Antal sidor408
FörlagTaylor & Francis Ltd
ISBN9781138466890

Tillhör följande kategorier

Matematikens grunder inom Naturvetenskap och teknik

Type 1 Calculus and Automated Mathematics. Lambda Calculus Extended With Segments. Well-Ordering and Induction in Intuitioinistic Logic. Separating Relaltivized Complexity Classes. Generalizing Automath By Means Of A Lambda-Typed Lambda Calculus. Local Concepts and Germ Representability. Model Theory of Profinite Groups Having IP. An Extension of Frege Structures. Oracles: Three New Results. Kueker's Conjecture For O Minimal Theories. On The Embedding of Manifolds Into The Smooth Zariski Topos. Rings Of Smooth Functions And Their Localizations. Interpolation And Conceptual Completeness For Pretopose Via Category Theory. Finite QE Rings In Characterist 4. Computatable Functions In Categories. A Note On The Complexity of Synthesizing Finite Machines.