Preview
Unable to display preview. Download preview PDF.
References
E. Bombieri and T. Vaalen, On Siegel's Lemma. Inventiones 73 (1983) 11–32.
D. van Dalen and A. S. Troelstra (eds.), Proc. Brouwer Centenary Conference. North-Holland 1982.
T.-Y. Girard, II 12 -logic. I. Annals of Mathematical Logic 21 (1981) 75–219.
C.A. Goad, Computational Uses of the Manipulation of Formal Proofs. STAN-CS-80-819, Stanford U., 1980.
R. O. Gandy and T. M. Hyland (eds.), Logic Colloquium 76. North-Holland 1977.
G. Kreisel, Frege's Foundations and Intuitionistic Logic. The Monist 67 (1984) 72–91.
H. Luckhardt, ∑2-Herbrand-Analysen: polynomiale Anzahlschranken für den Satz von Roth (to appear).
T. Naur, Mullin's Sequence of Primes is Not Monotonic. Proc. A.M.S. 90 (1984) 43–44.
R. Parikh (ed.), Springer Lecture Notes in Math. 453 (1975).
H. A. Simon, Computer Modelling of Scientific and Mathematical Discovery Processes. Bull. A.M.S. 11 (1984) 247–263.
S. Smale, The Fundamental Theorem of Algebra and Complexity Theory. Bull. A.M.S. 4 (1981) 1–36.
R. Statman, Lower Bounds on Herbrand's Theorem. Proc. A.M.S. 75 (1979) 104–107.
T. Stern (ed.), Proc. Herbrand Symposium. North-Holland, 1982.
Author information
Authors and Affiliations
Editor information
Rights 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