Book contents
- Frontmatter
- Contents
- Preface
- Part I Invited Papers
- 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
- 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
- References
A Bounded Arithmetic Theory for Constant Depth Threshold Circuits
from Part II - Contributed Papers
Published online by Cambridge University Press: 23 March 2017
- Frontmatter
- Contents
- Preface
- Part I Invited Papers
- 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
- 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
- References
Summary
- Type
- Chapter
- Information
- Gödel '96Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy, pp. 224 - 234Publisher: Cambridge University PressPrint publication year: 2017