Skip to main content
SpringerLink
Log in

Proof theory and the synthesis of programs: Potential and limitations

  • Conference paper
  • First Online:
Book cover EUROCAL '85 (EUROCAL 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 203))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Bombieri and T. Vaalen, On Siegel's Lemma. Inventiones 73 (1983) 11–32.

    Article  Google Scholar 

  2. D. van Dalen and A. S. Troelstra (eds.), Proc. Brouwer Centenary Conference. North-Holland 1982.

    Google Scholar 

  3. T.-Y. Girard, II 12 -logic. I. Annals of Mathematical Logic 21 (1981) 75–219.

    Article  Google Scholar 

  4. C.A. Goad, Computational Uses of the Manipulation of Formal Proofs. STAN-CS-80-819, Stanford U., 1980.

    Google Scholar 

  5. R. O. Gandy and T. M. Hyland (eds.), Logic Colloquium 76. North-Holland 1977.

    Google Scholar 

  6. G. Kreisel, Frege's Foundations and Intuitionistic Logic. The Monist 67 (1984) 72–91.

    Google Scholar 

  7. H. Luckhardt, ∑2-Herbrand-Analysen: polynomiale Anzahlschranken für den Satz von Roth (to appear).

    Google Scholar 

  8. T. Naur, Mullin's Sequence of Primes is Not Monotonic. Proc. A.M.S. 90 (1984) 43–44.

    Google Scholar 

  9. R. Parikh (ed.), Springer Lecture Notes in Math. 453 (1975).

    Google Scholar 

  10. H. A. Simon, Computer Modelling of Scientific and Mathematical Discovery Processes. Bull. A.M.S. 11 (1984) 247–263.

    Google Scholar 

  11. S. Smale, The Fundamental Theorem of Algebra and Complexity Theory. Bull. A.M.S. 4 (1981) 1–36.

    Google Scholar 

  12. R. Statman, Lower Bounds on Herbrand's Theorem. Proc. A.M.S. 75 (1979) 104–107.

    Google Scholar 

  13. T. Stern (ed.), Proc. Herbrand Symposium. North-Holland, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Stanford University, 94305, STANFORD, CA, USA

    G. Kreisel

Authors
  1. G. Kreisel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreisel, G. (1985). Proof theory and the synthesis of programs: Potential and limitations. In: Buchberger, B. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15983-5_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-15983-5_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15983-4

  • Online ISBN: 978-3-540-39684-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation