Gödel '96 : logical foundations of mathematics, computer science, and physics - Kurt Gödel's legacy : Bruno, Czech Republic, August 1996, Proceedings
Author(s)
Bibliographic Information
Gödel '96 : logical foundations of mathematics, computer science, and physics - Kurt Gödel's legacy : Bruno, Czech Republic, August 1996, Proceedings
（Lecture notes in logic, 6）
Springer, c1996
Available at / 37 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Bruno||1996.896044826
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This is a proceedings volume of the conference celebrating the 90th anniversary of the birth of Kurt Goedel. The conference has been recognized as an ASL sponsored meeting. Invited papers and contributed papers concern mainly mathematical logic but also philosophy of mathematics, computer science and physics and are devoted to topics related to Goedel's work and reflect the present state of knowledge domains deeply influenced by Goedel.
Table of Contents
I. Invited Papers.- Godel's program for new axioms: Why, where, how and what?.- Infinite-valued Godel Logics with 0-1-Projections and Relativizations.- Contributions of K. Godel to Relativity and Cosmology.- Kurt Godel and the constructive Mathematics of A.A. Markov.- Hao Wang as Philosopher.- A bottom-up approach to foundations of mathematics.- K-graph Machines: generalizing Turing's machines and arguments.- Forcing on Bounded Arithmetic.- Uniform Interpolation and Layered Bisimulation.- II. Contributed Papers.- Godel's Ontological Proof Revisited.- A Uniform Theorem Proving Tableau Method for Modal Logic.- Decidability of the ?*?*-Class in the Membership Theory NWL.- A Logical Approach to Complexity Bounds for Subtype Inequalities.- How to characterize provably total functions.- Completeness has to be restricted: Godel's interpretation of the parameter t.- A Bounded Arithmetic Theory for Constant Depth Threshold Circuits.- Information content and computational complexity of recursive sets.- Kurt Godel and the Consistency of R##.- Best possible answer is computable for fuzzy SLD-resolution.- The finite stages of inductive definitions.- Godel and the Theory of Everything.- Replacements? Collection.
by "Nielsen BookData"