David Kueker

Mathematical Logic and Theoretical Computer Science (eBook, ePUB)

• Format: ePub

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis eBooks
• Seitenzahl: 408
• Erscheinungstermin: 22. Dezember 2020
• Englisch
• ISBN-13: 9781000154603
• Artikelnr.: 60802235

Autorenporträt

David Kuekker is a professor of mathematics at the University of Maryland, College Park.

Inhaltsangabe

1. Typed ¿ - Calculus and Automated Mathematics 2. Lambda Calculus Extended
with Segments 3. Well-Ordering and Induction in Intuitionistic Logic and
Topoi 4. Separating Relativized Complexity Classes 5. Generalizing Automath
by Means of a Lambda-Typed Lambda Calculus 6. Local Concepts and Germ
Representability 7. Model Theory of Profinite Groups Having IP, III 8. An
Extension of Frege Structures 9. Oracles: Three New Results 10. Kueker's
Conjecture for o-Minimal Theories 11. On the Embedding of Manifolds into
the Smooth Zariski Topos 12. Rings of Smooth Functions and Their
Localizations, II 13. Interpolation and Conceptual Completeness for
Pretoposes via Category Theory 14. Finite Quantifier-Eliminable Rings in
Characteristic 4 15. Computable Functions in Categories 16. A Note on the
Complexity of Synthesizing Finite Machines