Abstract
Traditional proof theory and Post-Turing computability are parts of discrete mathematics,whereas traditional analysis deals with non-discrete objects like real numbers and related topological notions. On the other hand,familiar mathematical proofs very often use methods of (functional)analysis which are compatible with functional formalizations of Post-Turing computability.We elaborate these connections with regard to the polynomial-time computability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[B]S. Buss,Bounded arithmetic, Bibliopolis, Napoli (1986)
[H]A. Haken,The intractability of resolution,Theor.Comp.Sci. 39 (1985), 297–308
[P]E. Post,Finite combinatory processes-formulation I, Journ.Symb.Logic 1 (1936),103–105
[T]G. Takeuti,Computational complexity and proof theory, Sugaku 39(2), 1987, 110–123 (Transl.inAMSSugaku expositions0(1),1988,1-14)
[Tu]_A. Turing,On computable numbers, with an application to the Entschei-dungsproblem, Proc.London Math.Soc.42(1937), 230–265
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gordeew, L. (2001). Proof Theory and Post-turing Analysis. In: Kahle, R., Schroeder-Heister, P., Stärk, R. (eds) Proof Theory in Computer Science. PTCS 2001. Lecture Notes in Computer Science, vol 2183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45504-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-45504-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42752-0
Online ISBN: 978-3-540-45504-2
eBook Packages: Springer Book Archive