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
Best possible answer is computable for fuzzy SLD-resolution
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. 257 - 266Publisher: Cambridge University PressPrint publication year: 2017
References
. Relevant arithmetic, (abstract), Bulletin of the section of logic
5 (1976), 133–137.Google Scholar
. Methods of Logic. Holt, New York, 1950.
. Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik
38 (1931), pp. 173–98, reprinted with English tr. in , , , , and (eds.), Kurt Gödel, Collected Works (vol. I), Oxford, 1986, pp. 144–95.Google Scholar
. Introduction to mathematical logic, van Nostrand, Princeton, 1964.
. Arithmetization of metamathematics in a general setting. Fundamenta mathematical
49 (1960), pp. 35–92.Google Scholar
. Hilbert. Springer, N. Y., 1970.
. The logic of provability. Cambridge, 1993.
and
Entailment (vol. I). Princeton, 1975.
, and . Entailment (vol. II). Princeton, 1992.
and . Inconsistent models for relevant arithmetics. The journal of symbolic logic
49 (1984), 917–929.Google Scholar
. ⊃E is admissible in “true” relevant arithmetic, forthcoming, Journal of philosophical logic.
. Logics without contraction. PhD thesis, U. of Queensland
1994.
. Logic programming. In: (Ed.) Handbook of Theoretical Computer Science. Vol. B, Formal methods and semantics, Elsevier, 1990, pp. 493–574.
. Mehrwertige Logik. Akademie Verlag, Berlin, 1988.
. Fuzzy logic from the logical point of view. In: , and , (Eds.) SOFSEM'95: Theory and Practice of Informatics, Lecture Notes in Comp. Sci., 1012, Springer, Berlin, 1995, pp. 31–49.
. Fuzzy logic and arithmetical hierarchy II. To appear in Studia Logica, 1997.
, and . A complete many-valued logic with product-conjunction. Preprint, 1996.
and . A strong theorem for finitely axiomatized fuzzy theories. Submitted to Proceedings of FSTA ’96, Tatra Mt. Math. Publ.
. Foundation of Logic Programming. Springer Verlag, Berlin, 1987.
. On the syntactico-semantical completeness of first-order fuzzy logic I, II. Kybemetika
26 (1990) 47–26, 134–152.Google Scholar
. On fuzzy logic I, II, III. Zeitschr. f. Math. Logik und Grundl. der Math. 25 (1979) 45–52, 119–134, 447–464.Google Scholar
and . Logic programming in RPL and RQL. In: , and , (Eds.) SOFSEM'95: Theory and Practice of Informatics, Lecture Notes in Comp. Sci., 1012, Springer, Berlin, 1995, pp. 487–492.
and . Soundness and completeness of non-classical extended SLD-resolution. In: , , and , (Eds.) Extensions of Logic Programming, 5th International Workshop, ELP'96, Lecture Notes in Artificial Intelligence 1050, Springer, Berlin, 1996, pp. 289–301.