> Lecture Notes in Logic
   Perspectives in Logic

   Other ASL Books

   Member Discounts


Available LNL volumes


 Editorial Policies

 Submission information

 Editorial Board












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

Petr Hájek (Editor)


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.

Year: 2001
ISBN: 1-56881-153-5
336 pages. Paperback.


Table of Contents

Part I. Invited Papers

Gödel's program for new axioms: Why, where, how and what?
Solomon Feferman

Infinite-valued Gödel Logics with 0-1-Projections and Relativizations.
Matthias Baaz

Contributions of K. Gödel to Relativity and Cosmology.
G.F.R. Ellis

Kurt Gödel and the constructive Mathematics of A.A. Markov.
Boris A. Kushner

Hao Wang as Philosopher.
Charles Parsons

A bottom-up approach to foundations of mathematics.
Pavel Pudlák

K-graph Machines: generalizing Turing's machines and arguments.
Wilfried Sieg and John Byrnes

Forcing on Bounded Arithmetic.
Gaisi Takeuti and Masahiro Yasumoto

Uniform Interpolation and Layered Bisimulation.
Albert Visser

Part II. Contributed Papers

Gödel's Ontological Proof Revisited.
C. Anthony Anderson and Michael Gettings

A Uniform Theorem Proving Tableau Method for Modal Logic.
Tadashi Araragi

Decidability of the $\exists^*\forall^*$-Class in the Membership Theory NWL.
Dorella Bellè and Franco Parlamento

A Logical Approach to Comlexity Bounds for Sbutype Inequalities.
Marcein Benke

How to characterize provably total functions.
Benjamin Blankertz and Andreas Weiermann

Completeness has to be restricted: Gödel's interpretation of the parameter t.
Giora Hon

A Bounded Arithmetic Theory for Constant Depth Threshold Circuits.
Jan Johannsen

Information content and computational complexity of recursive sets.
Lars Kristiansen

Kurt Gödel and the Consistency of R##.
Robert K. Meyer

Best possible answer is computable for fuzzy SLD-resolution.
Leonard Paulík

The finite stages of inductive definitions.
Robert F. Stärk

Gödel and the Theory of Everything.
Michael Stöltzner

Replacement $\not\to$ Collection.
Andrezej M. Zarach

<Back to LNL titles listing



[ Meetings | Announcements | Membership | Journals | ASL Books | Links to Other Sites | ASL Info | Home]