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
Decidability of the Class in the Membership Theory NWL
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. 183 - 194Publisher: Cambridge University PressPrint publication year: 2017
References
: A Uniform Prefixed Tableau Method for Positive First-Order Definable Systems, Workshop of Theorem Proving with Analytic Tableaux and Related Methods, Technical Report 8/92, University of Karlsruhe, Institut für Logik, Komplexitat und Deduktionssysteme, pp. 4–6, 1992.
:
Correspondence Theory,
in Handbook of Philosophical Logic II, pp.167–242, and eds., Dordrecht, Reidel, 1984.
and : Symbolic Logic and Mechanical Theorem Proving,
Academic Press, 1973.
: Proof Methods for Modal and Intuitionistic Logics, vol. 169 of Synthese library, Dordrecht, Reidel, 1983.
and : Logic-Based Knowledge Representation,
The MIT Press, 1989.
and : An Introduction to Modal Logic,
London, Methuen, 1968.
: Highway to the Danger Zone, Journal of Logic and Computation, to appear.
. Reasoning About Knowledge and Action, PhD Thesis, MIT, Cambridge, 1980.
: First-Order Modal Logic Theorem Proving and Functional Simulation, 13th IJCAI, pp.80–85, 1993.
.
Semantics-based translation methods for modal logics,
Journal of Logic and Computation, vol. 1, pp. 691–746, 1991.Google Scholar
: Automated Proof Search in Non-Classical Logics,
The MIT Press, 1989.