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
The finite stages of inductive definitions
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. 267 - 290Publisher: Cambridge University PressPrint publication year: 2017
References
and . Reasoning about termination of pure Prolog programs. Information and Computation,
106(1):109–157, 1993.Google Scholar
. The recursion-theoretic complexity of the semantics of predicate logic as a programming language. Information and Control,
54:25–47, 1982.Google Scholar
and . Definite clause programs are canonical (over a suitable domain). Annals of Mathematics and Artificial Intelligence,
1:1–19, 1990.Google Scholar
and . How to characterize provably total functions by the Buchholz operator method. This volume.
. A simplified version of local predicativity. In , , and , editors, Proof Theory. A selection of papers from the Leeds Proof Theory Programme 1990, pages 115–147. Cambridge University Press, 1992.
, , and . A uniform approach to fundamental sequences and hierarchies. Mathematical Logic Quarterly,
40:273–286, 1994.Google Scholar
, , , and . Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies, volume 897 of Lecture Notes in Mathematics.
Springer-Verlag, Berlin, 1981.
. Levels of implication and type free theories of classifications with approximation operator. Zeitschrift für mathematische Logik und Grundlagen der Mathematik,
38:107–141, 1992.Google Scholar
. Proof-theoretic aspects of self-referential truth. Technical report, Department of Philosophy, Università degli Studi di Firenze, 1995.
. Negation as failure. In and , editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.
. A Kripke-Kleene semantics for logic programs. J. of Logic Programming,
2:295–312, 1985.Google Scholar
. Fixed points in Peano arithmetic with ordinals. Annals of Pure and Applied Logic,
60:119–132, 1993.Google Scholar
and . A proof-theoretic framework for logic programming. In , editor, Handbook of Proof Theory. To appear.
. Signed data dependencies in logic programs. J. of Logic Programming,
7(3):231–245, 1989.Google Scholar
. Axiomatizable classes of locally free algebras of various types. In The Metamathematics of Algebraic Systems, Collected Papers, chapter 23, pages 262–281. North-Holland, Amsterdam, 1971.
. Elementary Induction on Abstract Structures.
North-Holland, Amsterdam, 1974.
. Proof theory: an introduction, volume 1407 of Lecture Notes in Mathematics.
Springer-Verlag, Berlin, 1989.
. A short course in ordinal analysis. In , , and , editors, Proof Theory. A selection of papers from the Leeds Proof Theory Programme 1990, pages 26–78. Cambridge University Press, 1992.
. Language and equality theory in logic programming. Technical Report PM-88–08, University of Bristol, 1988.
. Input/output dependencies of normal logic programs. J. of Logic and Computation,
4(3):249–262, 1994.Google Scholar
. First-order theories for pure Prolog programs with negation. Archive for Mathematical Logic,
34(2): 113–144, 1995.Google Scholar
. Formal methods for logic programming systems. Technical report, Department of Mathematics, Stanford University, 1995.
. Total correctness of pure Prolog programs: A formal approach. In , , and , editors, Proceedings of the 5th International Workshop on Extensions of Logic Programming, ELP '96, pages 237–254, Leipzig, Germany, 1996. Springer-Verlag, Lecture Notes in Artificial Intelligence 1050.
and . The semantics of predicate logic as a programming language. J. of the Association for Computing Machinery,
4(23):733–742, 1976.Google Scholar
. How to characterize provably total functions by local predicativity. J. of Symbolic Logic. To appear.