Cantitate/Preț
Produs
Total produse
Vezi coșul
Mathematical Logic and Theoretical Computer Science de David Kueker

Mathematical Logic and Theoretical Computer Science: Lecture Notes in Pure and Applied Mathematics

Autor David Kueker
en Limba Engleză Paperback – 22 dec 1986
This book includes articles on denotational semanitcs, recursion theoretic aspects of computer science, model theory and algebra, automath and automated reasoning, stability theory, topoi and mathematics, and topoi and logic. It is intended for mathematical logicians and computer scientists.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 199027 lei  6-8 săpt.
  CRC Press – 22 dec 1986 199027 lei  6-8 săpt.
Hardback (1) 107876 lei  6-8 săpt.
  CRC Press – 6 noi 2017 107876 lei  6-8 săpt.

Din seria Lecture Notes in Pure and Applied Mathematics

Preț: 199027 lei

Preț vechi: 242716 lei
-18% Nou

Puncte Express: 2985
Preț estimativ în valută:
35217€ • 41353$ • 30912£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780824777463
ISBN-10: 0824777468
Pagini: 408
Dimensiuni: 178 x 254 x 19 mm
Greutate: 0.71 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Seria Lecture Notes in Pure and Applied Mathematics

Public țintă

Professional

Cuprins

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

Notă biografică

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

Descriere

This book includes articles on denotational semanitcs, recursion theoretic aspects of computer science, model theory and algebra, automath and automated reasoning, stability theory, topoi and mathematics, and topoi and logic. It is intended for mathematical logicians and computer scientists.