Abstract
We present a method to extract constructive proofs from classical arguments proved by topogical means. Typically, this method will apply to the nonconstructive use of compactness in combinatorics, often in the form of the use of König's lemma (which says that a finitely branching tree that is infinite has an infinite branch.) The method consists roughly of working with the corresponding point-free version of the topological argument, which can be proven constructively using only as primitive the notion of inductive definition. We illustrate here this method on the classical “minimal bad sequence” argument used by Nash-Williams in his proof of Kruskal's theorem. The proofs we get by this method are well-suited for mechanisation in interactive proof systems that allow the user to introduce inductively defined notions, such as NuPrl, or Martin-Löf set theory.
Preview
Unable to display preview. Download preview PDF.
References
Brouwer, L. E. J., Uber definitionsbereiche von Funktionen, Math. Ann. 96 (1927), 60–75.
Martin-Löf, P., Notes on Constructive Mathematics, Almqvist & Wiksell, 1968.
Martin-Löf, P., Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions, Proceedings of the Second Scandinavian Logic Symposium, (1971), 179–216, J.E. Fenstad, editor.
De Bruijn, N. G. and Van Der Meiden, W., Notes on Gelfand's Theory, Indagationes 31 (1968), 467–464.
Nash-Williams, C., On well-quasi-ordering finite trees, Proc. Cambridge Phil. Soc. 59, (1963), 833–835.
Vickers, S., Topology via Logic, Cambridge Tracts in Theoretical Computer Science 5, 1989.
Johnstone, P.J., Stone Spaces, Cambridge Studies in Advanced Mathematics, 1981.
Coquand, Th., An Intuitionistic Proof of Tychonoff's Theorem, submitted to the Journal of Symbolic Logic (1991).
Martin-Löf, P., Domain interpretation of type theory, Workshop on the Semantics of Programming Languages, Chalmers (1983).
Abramsky, S., Domain Theory in Logical Form, Annals of Pure and Applied Logic (1991).
Lorenzen, P., Logical Reflection and Formalism, Journal of Symbolic Logic (1958).
Russell, B., On order in time, in Logic and Knowledges, essays 1901–1950, R.C. Marsh, editor, 1936.
Wiener, N., A Contribution to the Theory of Relative Position, Proc. Camb. Phil. Soc., Vol. 17 (1914).
Raoult, J.C., An open induction principle, INRIA Report (1988).
Russell, B., Our Knowledge of the External World, Cambridge University Press, 1914.
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coquand, T. (1992). Constructive topology and combinatorics. In: Myers, J.P., O'Donnell, M.J. (eds) Constructivity in Computer Science. Constructivity in CS 1991. Lecture Notes in Computer Science, vol 613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021089
Download citation
DOI: https://doi.org/10.1007/BFb0021089
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55631-2
Online ISBN: 978-3-540-47265-0
eBook Packages: Springer Book Archive