Godel '96: Logical Foundations of Mathematics, Computer Science and Physics-Kurt Godel's Legacy: No. 6 - Brossura

9783540614340: Godel '96: Logical Foundations of Mathematics, Computer Science and Physics-Kurt Godel's Legacy: No. 6

Brossura

ISBN 10: 3540614346 ISBN 13: 9783540614340

Casa editrice: Springer Verlag, 2013

Vedi tutte le copie di questa edizione con ISBN

The aim of the conference Logical Foundations of Mathematics, Computer Science and Phycics - Kurt Godel's Legacy (GO DEL '96}, organized to the occasion of the ninetieth anniversary of the birth of Kurt Godel, is to pay tribute to Kurt Godel by arranging a scientific event presenting a forum for papers relevant to foundational aspects of Logic in Mathematics, Computer Science, Philosophy and Physics - areas influenced by Kurt Godel's work. The conference has been organized in Brno, the birthplace of Godel, by Masaryk University Brno in co-operation with the Institute of Computer Science of the Academy of Sciences of the Czech Republic, Prague, and with the international Kurt Godel Society based in Vienna (Organizing Committee chaired by J. Zlatuska). The Association for Symbolic Logic has recognized the conference as an ASL sponsored meeting. The Program Committee has consisted of Z. Adamowicz, Warsaw; J. Bicak, Prague; L. Bukovsky, Kosice; D. de Jongh, Amsterdam; J. Grygar, Prague; E. Kohler, Vienna; J. Krajicek, Prague; P. Hajek (chair), Prague; A. Leitsch, Vienna; D. Mundici, Milano; G. Miiller, Heidelberg; J. Paris, Manchester; C. Parsons, Harvard.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

I. Invited Papers.- G�del’s program for new axioms: Why, where, how and what?.- Infinite-valued G�del Logics with 0-1-Projections and Relativizations.- Contributions of K. G�del to Relativity and Cosmology.- Kurt G�del 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.- G�del’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: G�del’s interpretation of the parameter t.- A Bounded Arithmetic Theory for Constant Depth Threshold Circuits.- Information content and computational complexity of recursive sets.- Kurt G�del and the Consistency of R##.- Best possible answer is computable for fuzzy SLD-resolution.- The finite stages of inductive definitions.- G�del and the Theory of Everything.- Replacements? Collection.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.