Abstract
This final chapter is devoted to a different link between the notions of a proof and of an algorithm: some proofs—called constructive—may be used as algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dowek, G. (2011). Constructivity. In: Proofs and Algorithms. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-121-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-85729-121-9_8
Publisher Name: Springer, London
Print ISBN: 978-0-85729-120-2
Online ISBN: 978-0-85729-121-9
eBook Packages: Computer ScienceComputer Science (R0)