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
Kurt Gödel and the Consistency of R##
from Part II - Contributed Papers
Published online by Cambridge University Press: 23 March 2017
Edited by
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
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Gödel '96Logical Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy, pp. 247 - 256Publisher: Cambridge University PressPrint publication year: 2017
References
. On the structure of polynomial time degrees of recursive sets. (Habilitationsschrift) Forschungsbericht Nr. 206/1985. Universität Dortmund, Dortmund, Germany, 1985. (P.O. Box 500500, D-4600 Dortmund 50)
. On the structure of subrecursive degrees. Journal of Computer and System Sciences
4 (1970), 452–464.Google Scholar
and . Axioms for subrecursion theories. In: Computability, enumerability, unsolvability, (eds. ) 123–138. LMS Lecture Note Series 224, Cambridge University Press, 1996.
. On some classes of subrecursive functions. Norsk Informatikkonferanse’
94. ISBN 82–519–1428–0, 33–52.
. A jump operator on honest subrecursive degrees. Submitted.
. On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery
22 (1975), 155–171.Google Scholar
. Augmented loop languages and classes of computable functions. Journal of Computer and System Sciences
6 (1972), 603–624.Google Scholar
. The honest subrecursive classes are a lattice. Information and Control
24 (1974), 247–263.Google Scholar
. On the density of honest subrecursive classes. Journal of Computer and System Sciences
10 (1975), 183–199.Google Scholar
and . A classification of the recursive functions. Zeitschr. f. math. Logik und Grundlagen d. Math. Bd. 18 (1972), 71–82.Google Scholar
. Classical recursion theory. North-Holland, 1989.
. Rekursive Funktionen. Verlag der Ungarischen Akademie der Wissenschaften, Budapest, 1957. [English translation: Academic Press, New York, 1967]
. Theory of recursive functions and effective computability. McGraw Hill, 1967.
. Subrecursion. Functions and hierarchies. Clarendon Press, Oxford, 1984.
. A density property of the primitive recursive degrees. Technical Report Series UMCS-93–1-1 Department of Computer Science, University of Manchester, 1993.