Mathematical Logic and Theoretical Computer Science / Edition 1

Mathematical Logic and Theoretical Computer Science / Edition 1

by David Kueker
ISBN-10:
0824777468
ISBN-13:
9780824777463
Pub. Date:
12/22/1986
Publisher:
Taylor & Francis
ISBN-10:
0824777468
ISBN-13:
9780824777463
Pub. Date:
12/22/1986
Publisher:
Taylor & Francis
Mathematical Logic and Theoretical Computer Science / Edition 1

Mathematical Logic and Theoretical Computer Science / Edition 1

by David Kueker
$350.0
Current price is , Original price is $350.0. You
$350.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.

Product Details

ISBN-13: 9780824777463
Publisher: Taylor & Francis
Publication date: 12/22/1986
Series: Lecture Notes in Pure and Applied Mathematics , #106
Pages: 408
Product dimensions: 7.00(w) x 10.00(h) x (d)

About the Author

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

Table of Contents

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
From the B&N Reads Blog

Customer Reviews