Skip to main content
SpringerLink
Log in

On “provable” analogs of and

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

It is shown that the addition of “provability” requirements to the definitions of

and

does not seem to simplify the

=

question.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. C. Fischer, “Theory of provable functions,”Trans. Amer. Math. Soc. 117, 494–520 (1965).

    Google Scholar 

  2. J. Hartmanis, “Relations between diagonalization, proof systems, and complexity gaps,”Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, 223–227 (1977).

  3. H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

    Google Scholar 

  4. P. R. Young, “Optimization among provably equivalent programs,”J. Assoc. Comput. Mach. 24, 693–700 (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Iowa, 52242, Iowa City, Iowa, USA

    Theodore P. Baker

Authors
  1. Theodore P. Baker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work partially supported by NSF grants DCR75-06340 and MCS77-24098.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baker, T.P. On “provable” analogs of and . Math. Systems Theory 12, 213–218 (1978). https://doi.org/10.1007/BF01776574

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01776574

Keywords

Search

Navigation