Gödel '96 : Logical Foundations of Mathematics, Computer Science and Physics -- Kurt Gödel's Legacy
| Gödel '96 : Logical Foundations of Mathematics, Computer Science and Physics -- Kurt Gödel's Legacy |
| Autore | Hajek Petr |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer, , 1996 |
| Descrizione fisica | 1 online resource (332 pages) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
GirardJ.-Y
LachlanA |
| Collana | Lecture Notes in Logic |
| ISBN | 3-662-21963-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lecture Notes in Logic 6 Gödel '96 Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy -- Gödel '96 -- Copyright -- Preface -- Table of Contents -- Part 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 * -- Part 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 by the Buchholz operator method * -- 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 * -- Replacement→ Collection *. |
| Altri titoli varianti | Gödel '96 |
| Record Nr. | UNISA-996210817803316 |
Hajek Petr
|
||
| Berlin, Heidelberg : , : Springer, , 1996 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Gödel '96 : Logical Foundations of Mathematics, Computer Science and Physics -- Kurt Gödel's Legacy
| Gödel '96 : Logical Foundations of Mathematics, Computer Science and Physics -- Kurt Gödel's Legacy |
| Autore | Hajek Petr |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer, , 1996 |
| Descrizione fisica | 1 online resource (332 pages) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
GirardJ.-Y
LachlanA |
| Collana | Lecture Notes in Logic |
| ISBN | 3-662-21963-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lecture Notes in Logic 6 Gödel '96 Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy -- Gödel '96 -- Copyright -- Preface -- Table of Contents -- Part 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 * -- Part 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 by the Buchholz operator method * -- 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 * -- Replacement→ Collection *. |
| Altri titoli varianti | Gödel '96 |
| Record Nr. | UNINA-9910744597803321 |
Hajek Petr
|
||
| Berlin, Heidelberg : , : Springer, , 1996 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Recursion theory
| Recursion theory |
| Autore | Shoenfield Joseph R (Joseph Robert), <1927-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer, , 1993 |
| Descrizione fisica | 1 online resource (89 pages) |
| Disciplina | 511.35 |
| Altri autori (Persone) |
GirardJ.-Y
LachlanA |
| Collana | Lecture Notes in Logic |
| ISBN | 3-662-22378-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lecture Notes in Logic 1 Recursion Theory -- Recursion Theory -- Copyright -- Introduction -- CONTENTS -- 1. Computability -- 2. Functions and Relations -- 3. The Basic Machine -- 4. Macros -- 5. Closure Properties -- 6. Definitions of Recursive Functions -- 7. Codes -- 8. Indices -- 9. Church's Thesis -- 10. Word Problems -- 11. Undecidable Theories -- 12. Relative Recursion -- 13. The Arithmetical Hierarchy -- 14. Recursively Enumerable Relations -- 15. Degrees -- 16. Evaluation of Degrees -- 17. Large RE Sets -- 18. Function of Reals -- 19. The Analytical Hierarchy -- 20. The Projective Hierarchy -- Suggestions for Further Reading -- Index. |
| Record Nr. | UNISA-996210817303316 |
Shoenfield Joseph R (Joseph Robert), <1927->
|
||
| Berlin, Heidelberg : , : Springer, , 1993 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recursion theory
| Recursion theory |
| Autore | Shoenfield Joseph R (Joseph Robert), <1927-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer, , 1993 |
| Descrizione fisica | 1 online resource (89 pages) |
| Disciplina | 511.35 |
| Altri autori (Persone) |
GirardJ.-Y
LachlanA |
| Collana | Lecture Notes in Logic |
| ISBN | 3-662-22378-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lecture Notes in Logic 1 Recursion Theory -- Recursion Theory -- Copyright -- Introduction -- CONTENTS -- 1. Computability -- 2. Functions and Relations -- 3. The Basic Machine -- 4. Macros -- 5. Closure Properties -- 6. Definitions of Recursive Functions -- 7. Codes -- 8. Indices -- 9. Church's Thesis -- 10. Word Problems -- 11. Undecidable Theories -- 12. Relative Recursion -- 13. The Arithmetical Hierarchy -- 14. Recursively Enumerable Relations -- 15. Degrees -- 16. Evaluation of Degrees -- 17. Large RE Sets -- 18. Function of Reals -- 19. The Analytical Hierarchy -- 20. The Projective Hierarchy -- Suggestions for Further Reading -- Index. |
| Record Nr. | UNINA-9910482885103321 |
Shoenfield Joseph R (Joseph Robert), <1927->
|
||
| Berlin, Heidelberg : , : Springer, , 1993 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||