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.
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