Godel 96: Logical Foundations of Mathematics, Computer Science, and Physics: Lecture Notes in Logic 6

Godel 96: Logical Foundations of Mathematics, Computer Science, and Physics: Lecture Notes in Logic 6

by Petr Hajek, Petr Hajek, Godel '96
     
 

ISBN-10: 1568811535

ISBN-13: 9781568811536

Pub. Date: 03/26/2001

Publisher: Taylor & Francis

This volume contains the proceedings of the conference Logical Foundations of Mathematics, Computer Science, and Physics-Kurt Gödel's Legacy, held in Brno, Czech Republic on the 90th anniversary of his birth. The wide and continuing importance of Gödel s work in the logical foundations of mathematics, computer science, and physics is confirmed by the

Overview

This volume contains the proceedings of the conference Logical Foundations of Mathematics, Computer Science, and Physics-Kurt Gödel's Legacy, held in Brno, Czech Republic on the 90th anniversary of his birth. The wide and continuing importance of Gödel s work in the logical foundations of mathematics, computer science, and physics is confirmed by the broad range of speakers who participated in making this gathering a scientific event.

Product Details

ISBN-13:
9781568811536
Publisher:
Taylor & Francis
Publication date:
03/26/2001
Series:
Lecture Notes in Logic Series
Edition description:
Reprint
Pages:
336
Product dimensions:
65.00(w) x 90.00(h) x 7.50(d)

Table of Contents

PrefaceV
Part I.Invited Papers
Godel's program for new axioms: Why, where, how and what?3
Infinite-valued Godel Logics with 0-1-Projections and Relativizations23
Contributions of K. Godel to Relativity and Cosmology34
Kurt Godel and the constructive Mathematics of A.A. Markov50
Hao Wang as Philosopher64
A bottom-up approach to foundations of mathematics81
K-graph Machines: generalizing Turing's machines and arguments98
Forcing on Bounded Arithmetic120
Uniform Interpolation and Layered Bisimulation139
Part II.Contributed Papers
Godel's Ontological Proof Revisited167
A Uniform Theorem Proving Tableau Method for Modal Logic173
Decidability of the [exist]*[of all]*-Class in the Membership Theory NWL183
A Logical Approach to Complexity Bounds for Subtype Inequalities195
How to characterize provably total functions205
Completeness has to be restricted: Godel's interpretation of the parameter t214
A Bounded Arithmetic Theory for Constant Depth Threshold Circuits224
Information content and computational complexity of recursive sets235
Kurt Godel and the Consistency of R##247
Best possible answer is computable for fuzzy SLD-resolution257
The finite stages of inductive definitions267
Godel and the Theory of Everything291
Replacement[not right arrow] Collection307

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >