skip to main content
10.1145/800169.805434acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free Access

Formalization of properties of recursively defined functions

Authors Info & Claims
Published:05 May 1969Publication History

ABSTRACT

This paper is concerned with the relationship between the convergence, correctness and equivalence of recursively defined functions and the satisfiability (or unsatisfiability) of certain first-order formulas.

References

  1. 1.Church, A. Introduction to Mathematical Logic. Volume 1, Princeton University Press, Princeton (1956).Google ScholarGoogle Scholar
  2. 2.Cooper, D. C. The equivalence of certain computations. The Computer Journal 9, 1 (1966), 45-52.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3.Cooper, D. C. Program scheme equivalences and second order logic. Presented at Fourth Annual Machine Intelligence Workshop, University of Edinburgh (August 1968).Google ScholarGoogle Scholar
  4. 4.Floyd, R. W. Assigning Meaning to Programs. Proceedings of Symposia in Applied Mathematics, American Mathematical Society, Vol. 19 (1967), 19-32.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5.Manna, Z. Termination of algorithms. Ph.D. Thesis, Computer Science Department, Carnegie-Mellon University (April 1968). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Manna, Z. Formalization of properties of programs. Stnaford Artificial Intelligence Report, Memo No. AI-64 (July 1968).Google ScholarGoogle Scholar
  7. 7.Manna, Z., and Pnueli, A. The validity problem of the 91-function. Stanford Artificial Intelligence Report, Memo No. AI-68 (Aug. 1968).Google ScholarGoogle Scholar
  8. 8.McCarthy, J. Towards a Mathematical Science of Computation. Proc. ICIP Congress 62, North-Holland, Amsterdam (1962), 21-28.Google ScholarGoogle Scholar
  9. 9.McCarthy, J. A basis for a mathematical theory of computation. In Braffort,P., and Hirschberg, D. (Eds.), Computer Programming and Formal Systems. North-Holland, Amsterdam (1963).Google ScholarGoogle Scholar
  10. 10.Mendelson, E. Introduction to Mathematical Logic. D. Van Nostrand Company, Princeton (1964). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Formalization of properties of recursively defined functions

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            STOC '69: Proceedings of the first annual ACM symposium on Theory of computing
            May 1969
            267 pages
            ISBN:9781450374781
            DOI:10.1145/800169

            Copyright © 1969 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 5 May 1969

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,469of4,586submissions,32%

            Upcoming Conference

            STOC '24
            56th Annual ACM Symposium on Theory of Computing (STOC 2024)
            June 24 - 28, 2024
            Vancouver , BC , Canada

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader