Lecture Notes in Logic: Series Number 6 Goedel '96: Logical Foundations of Mathematics, Computer Science and Physics - Kurt Goedel's Legacy

Lecture Notes in Logic: Series Number 6 Goedel '96: Logical Foundations of Mathematics, Computer Science and Physics - Kurt Goedel's Legacy

By: Petr Hajek (editor)Hardback

Special OrderSpecial Order item not currently available. We'll try and order for you.


Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the sixth publication in the Lecture Notes in Logic series, collects the proceedings of the conference 'Logical Foundations of Mathematics, Computer Science, and Physics - Kurt Goedel's Legacy', held in Brno, Czech Republic, on the 90th anniversary of Goedel's birth. The broad range of speakers who participated in this event affirms the continuing importance of Goedel's work in logic, physics, and the philosophy and foundations of mathematics and computer science. The papers in this volume range over all these topics and contribute to our present understanding of them.

About Author

Petr Hajek works in the Academy of Sciences of the Czech Republic, Prague.


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. Stark; 21. Goedel and the theory of everything Michael Stoeltzner; 22. Replacement / collection Andrzej M. Zarach.

Product Details

  • ISBN13: 9781107168022
  • Format: Hardback
  • Number Of Pages: 330
  • ID: 9781107168022
  • weight: 660
  • ISBN10: 1107168023

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly