Gödel '96
Subtitle: Foundations of Mathematics, Computer Science and Physics?Kurt Gödel's Legacy (Lecture Notes in Logic, 6)
Contributors: Petr Hajek (Editor)
Publisher: AK Peters, Ltd.
Published: March 20, 2000
Language: eng
Format: Paperback
Number of pages: 336
ISBN-13: 9781568811536
Subjects: Computer Programming; Mathematical logic; PHYSICS; Logic, Symbolic and mathematical; Congresses; Mathematics; Science/Mathematics; Logic; Computer science; Logic, Symbolic and mathematic; Philosophy
First sentence: Summary. From 1931 until late in his life (at least 1970) Godel called for the pursuit of new axioms for mathematics to settle both undecided number-theoretical propositions (of the form obtained in his incompleteness results) and undecided set-theoretical propositions (in particular CH).
Table of contents: title: Preface
pagenum: V; label: Part I
title: Invited Papers; title: Gödel's program for new axioms: Why, where, how and what?
pagenum: 3
authors: Solomon Feferman; title: Infinite-valued Gödel Logics with 0-1-Projections and Relativizations
pagenum: 23
authors: Matthias Baaz; title: Contributions of K. Gödel to Relativity and Cosmology
pagenum: 34
authors: G. F. R. Ellis; title: Kurt Gödel and the Constructive Mathematics of A. A. Markov
pagenum: 50
authors: Boris A. Kushner; title: Hao Wang as Philosopher
pagenum: 64
authors: Charles Parsons; title: A bottom-up approach to foundations of mathematics
pagenum: 81
authors: Pavel Pudlák; title: K-graph Machines: Generalizing Turing's Machines and Arguments
pagenum: 98
authors: Wilfried Sieg; John Byrnes; title: Forcing on Bounded Arithmetic
pagenum: 120
authors: Gaisi Takeuti; Masahiro Yasumoto; title: Uniform Interpolation and Layered Bisimulation
pagenum: 139
authors: Albert Visser; label: Part II
title: Contributed Papers; title: Gödel's Ontological Proof Revisited
pagenum: 167
authors: C. Anthony Anderson; Michael Gettings; title: A Uniform Theorem Proving Tableau Method for Modal Logic
pagenum: 173
authors: Tadashi Araragi; title: Decidability of the ∃*∀*-Class in the Membership Theory NWL
pagenum: 183
authors: Dorella Bellè; Franco Parlamento; title: A Logical Approach to Complexity Bounds for Subtype Inequalities
pagenum: 195
authors: Marcin Benke; title: How to Characterize Provably Total Functions
pagenum: 205
authors: Benjamin Blankertz; Andreas Weiermann; title: Completeness Has to Be Restricted: Gödel's Interpretation of the Parameter t
pagenum: 214
authors: Giora Hon; title: A Bounded Arithmetic Theory for Constant Depth Threshold Circuits
pagenum: 224
authors: Jan Johannsen; title: Information Content and Computational Complexity of Recursive Sets
pagenum: 235
authors: Lars Kristiansen; title: Kurt Gödel and the Consistency of R##
pagenum: 247
authors: Robert K. Meyer; title: Best Possible Answer Is Computable for Fuzzy SLD-Resolution
pagenum: 257
authors: Leonard Paulík; title: The Finite Stages of Inductive Definitions
pagenum: 267
authors: Robert F. Stärk; title: Gödel and the Theory of Everything
pagenum: 291
authors: Michael Stöltzner; title: Replacement ↛ Collection
pagenum: 307
authors: Andrzej M. Zarach