|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: David Kueker , Edgar G. K. Lopez-Escobar , Carl H. Smith , Edgar G.K. Lopez-EscobarPublisher: Taylor & Francis Inc Imprint: CRC Press Inc Volume: 106 Dimensions: Width: 17.80cm , Height: 2.10cm , Length: 25.40cm Weight: 0.725kg ISBN: 9780824777463ISBN 10: 0824777468 Pages: 408 Publication Date: 22 December 1986 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1. 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 MachinesReviewsAuthor InformationDavid Kuekker is a professor of mathematics at the University of Maryland, College Park. Tab Content 6Author Website:Countries AvailableAll regions |