Skip to main content
SpringerLink
Log in

Foundational problems from computation theory

  • Published:
Synthese Aims and scope Submit manuscript

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

References

  1. Broy, M. and B. Krieg-Brückner: 1980, ‘Derivation of Invariant Assertions during Program Development by Transformations’, ACM Trans. on Programming Languages and Systems 2, 321–327.

    Google Scholar 

  2. Chaitin, G.: 1975, ‘Randomness and Mathematical Proof’, Scientific American 232, 47–52.

    Google Scholar 

  3. Deborah, J. and P. Young: 1980, ‘Independence Results in Computer Science’, Proc. 12th Annual Symposium on Theory of Computing 58–69.

  4. De Millo, R. A. and R. J. Lipton: 1979, ‘Some Connections Between Mathematical Logic and Complexity Theory’, Proc. 11th Annual Symposium on Theory of Computing 153–159.

  5. De Millo, R. A. and R. J. Lipton: 1980, ‘The Consistency of P = NP and Related Problems With Fragments of Number Theory’, Proc. 12th Annual Symposium on Theory of Computing 45–57.

  6. De Millo, R. A., R. J. Lipton and A. J. Perlis: 1979, ‘Social Processes and Proofs of Theorems and Programs’, Comm. ACM 22, n. 5, 271–280.

    Google Scholar 

  7. Enderton, H. B.: 1972, A Mathematical Introduction to Logic, Academic Press, New York.

    Google Scholar 

  8. Hartmanis, J.: 1978, ‘Feasible Computations and Provable Complexity Properties’, SIAM.

  9. Hartmanis, J. and J. Hopcroft: 1976, ‘Independence Results in Computer Science’, Sigact News 8, n. 4.

    Google Scholar 

  10. Hofstadter, D. R.: 1979, Gödel, Escher, Bach, Vintage Book, New York.

    Google Scholar 

  11. Lolli, G.: 1980, ‘Logic and Foundations of Mathematics’, Scientia 115, 543–562.

    Google Scholar 

  12. Sacks, G.: 1975, ‘Remarks against Foundational Activity’, Historia Mathematica 2, 523–528.

    Google Scholar 

  13. Scott, D.: 1980, ‘Lambda Calculus: Some Models, Some Philosophy’, in Barwise J., H. J. Keisler and K. Kunen (eds.), The Kleene Symposium, North Holland, Amsterdam, pp. 223–265.

    Google Scholar 

  14. Wang, H.: 1980, Popular Lectures in Mathematical Logic, Van Nostrand, New York.

    Google Scholar 

  15. Wu, Wen-tsun: 1977, ‘The Decision Problem of Elementary Geometry and Mechanical Proof’, Chinese Science, n. 6, 507–516.

  16. Young, P.: 1977, ‘Optimization Among Provably Equivalent Programs’, Journal ACM 24, 693–700.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Science, Univ. of Torino, Corso M. d'Azeglio 42, 1015, Torino, Italy

    Gabriele Lolli

Authors
  1. Gabriele Lolli
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lolli, G. Foundational problems from computation theory. Synthese 62, 275–288 (1985). https://doi.org/10.1007/BF00486051

Download citation

  • Issue Date:

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

Keywords

Search

Navigation