Gödel '96: Logical foundations of mathematics, computer science and physics---Kurt Gödel's legacy, Brno, Czech Republic, August 1996, proceedings
Editor: Petr Hájek
Lecture Notes in Logic, Volume 6
Berlin: Springer-Verlag, 1996.
322 pp.
Subjects:
03A05 (primary)03Bxx (primary)
03Cxx (primary)
03Dxx (primary)
03Exx (primary)
03Fxx (primary)
85A40 (primary)
Mathmatical Reviews number (MathSciNet): MR1441098
ISBN:3-540-61434-6
Copyright © 1996, Association for Symbolic Logic.
Part I: Invited Papers
Gödel's program for new axioms: why, where, how and what?
Solomon Feferman; 3-22
Infinite-valued Gödel logics with $0$-$1$-projections and relativizations
Matthias Baaz; 23-33
Kurt Gödel and the constructive mathematics of A. A. Markov
Boris A. Kushner; 50-63
$K$-graph machines: generalizing Turing's machines and arguments
Wilfried Sieg, and John Byrnes; 98-119
Part II: Contributed Papers
Gödel's ontological proof revisited
C. Anthony Anderson, and Michael Gettings; 167-172
A uniform theorem proving tableau method for modal logic
Tadashi Araragi; 173-182
Decidability of the $\exists^*\forall^*$-class in the membership theory NWL
Dorella Bellè, and Franco Parlamento; 183-194
A logical approach to complexity bounds for subtype inequalities
Marcin Benke; 195-204
How to characterize provably total functions by the Buchholz operator method
Benjamin Blankertz, and Andreas Weiermann; 205-213
Completeness has to be restricted: Gödel's interpretation of the parameter $t$
Giora Hon; 214-223
A bounded arithmetic theory for constant depth threshold circuits
Jan Johannsen; 224-234
Information content and computational complexity of recursive sets
Lars Kristiansen; 235-246
Best possible answer is computable for fuzzy SLD-resolution
Leonard Paulík; 257-266
