Goedel '96

Preface; Part I. Invited Papers: 1. Goedel's program for new axioms: why, where, how and what? Solomon Feferman; 2. Infinite-valued Goedel logics with 0-1-projections and relativizations Matthias Baaz; 3. Contributions of K. Goedel to relativity and cosmology G. F. R. Ellis; 4. Kurt Goedel and the constructive mathematics of A. A. Markov Boris A. Kushner; 5. Hao Wang as philosopher Charles Parsons; 6. A bottom-up approach to foundations of mathematics Pavel Pudlak; 7. K-graph machines - generalizing Turing's machines and arguments Wilfried Sieg and John Byrnes; 8. Forcing on bounded arithmetic Gaisi Takeuti and Masahiro Yasumoto; 9. Uniform interpolation and layered bisimulation Albert Visser; Part II. Contributed Papers: 10. Goedel's ontological proof revisited C. Anthony Anderson and Michael Gettings; 11. A uniform theorem proving tableaux method for modal logic Tadashi Araragi; 12. Decidability of the \exists*\forall*-class in the membership theory NWL Dorella Belle and Franco Parlamento; 13. A logical approach to complexity bounds for subtype inequalities Marcin Benke; 14. How to characterize provably total functions Benjamin Blankertz and Andreas Weiermann; 15. Completeness has to be restricted - Goedel's interpretation of the parameter t Giora Hon; 16. A bounded arithmetic theory for constant depth threshold circuits Jan Johannsen; 17. Information content and computational complexity of recursive sets Lars Kristiansen; 18. Kurt Goedel and the consistency of R## Robert K. Meyer; 19. Best possible answer is computable for fuzzy SLD-resolution Leonard Paulik; 20. The finite stages of inductive definitions Robert F. Staerk; 21. Goedel and the theory of everything Michael Stoeltzner; 22. Replacement ?/? collection Andrzej M. Zarach.