{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":14,"n_cols":5,"rows_kept":14,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[13,2,13,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910744597803321"]
[null,null,"Autore",null,"Hajek Petr"]
[null,null,"Titolo",null,"Gödel '96 : Logical Foundations of Mathematics, Computer Science and Physics -- Kurt Gödel's Legacy"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer, , 1996"]
[{"$nulls":4},"©1996"]
[null,null,"ISBN",null,"3-662-21963-8"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (332 pages)"]
[null,null,"Collana",null,"Lecture Notes in Logic ; ; v.6"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Lecture Notes in Logic 6 Gödel '96 Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy -- Gödel '96 -- Copyright -- Preface -- Table of Contents -- Part I Invited Papers -- Gödel's program for new axioms: Why, where, how and what? -- Infinite-valued Gödel Logics with 0-1-Projections and Relativizations * -- Contributions of K. Gödel to Relativity and Cosmology * -- Kurt Gö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 * -- Part II Contributed Papers -- Gö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 by the Buchholz operator method * -- Completeness has to be restricted: Gö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 Gödel and the Consistency of R##* -- Best possible answer is computable for fuzzy SLD-resolution * -- The finite stages of inductive definitions * -- Gödel and the Theory of Everything * -- Replacement→ Collection *."]