Thierry Coquand  Home/Search
Context Related
| cs.chalmers.se/pub/users/coqu...pf.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math....cs.chalmers.se (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
...definitions. We isolate the main non constructive part, a minimal bad sequence argument, and use the open induction principle [Rao88, Coq92] to interpret it by induction. This leads to short constructive proofs of Dickson s lemma and Hilbert s basis theorem, which are...
...definitions. We isolate the main non constructive part, a minimal bad sequence argument, and use the open induction principle [Rao88,Coq92] to interpret it by induction. This leads to short constructive proofs of Dickson s lemma and Hilbert s basis theorem, which are...
Cited by: More
A Pointfree approach to Constructive Analysis in Type Theory - Cederquist (1997) (Correct)
A Machine Assisted Formalization of Pointfree Topology in Type.. - Cederquist (1994) (Correct)
A Note on the Open Induction Principle - Coquand (1997) (Correct)
Active bibliography (related documents): More All
0.5: A constructive topological proof of van der Waerden's theorem - Coquand (1993) (Correct)
0.4: Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (Correct)
0.3: Minimal Invariant Spaces in Formal Topology - Coquand (1996) (Correct)
Similar documents based on text: More All
0.1: Abelian l-Groups, Generalised Reals and Open Locales - Coquand (2003) (Correct)
0.1: A Simple Proof of Stone-Weirstrass - Coquand (Correct)
0.1: A Completness Proof for Geometrical Logic - Coquand (Correct)
Related documents from co-citation: More All
5: Notes on Constructive Mathematics (context) - Martin-Lof - 1970
5: Proving open properties by induction (context) - Raoult - 1988
5: An introduction to inductive definitions (context) - Aczel - 1977
BibTeX entry: (Update)
Th. Coquand. (1991) Constructive Topology and Combinatorics. In Constructivity in Computer Science, LNCS 613, 159-164 http://citeseer.ist.psu.edu/coquand91constructive.html More
@inproceedings{ coquand91constructive,
author = "Thierry Coquand",
title = "Constructive Topology and Combinatorics",
booktitle = "Constructivity in Computer Science",
pages = "159--164",
year = "1991",
url = "citeseer.ist.psu.edu/coquand91constructive.html" }
Citations (may not include all citations):75 Annals of Pure and Applied Logic (context) - Abramsky - 1991
41 Notes on Constructive Mathematics (context) - Martin-Lof - 1968
38 On well-quasi-ordering finite trees (context) - Nash-Williams - 1963
26 Cambridge Studies in Advanced Mathematics (context) - Johnstone - 1981
24 Cambridge Tracts in Theoretical Computer Science (context) - Vickers - 1989
21 Hauptsatz for the Intuitionistic Theory of Iterated Inductiv.. (context) - Martin-Lof - 1971
20 Our Knowledge of the External World (context) - Russell - 1914
14 A Contribution to the Theory of Relative Position (context) - Wiener - 1914
5 An Intuitionistic Proof of Tychonoff's Theorem (context) - Th - 1991
3 Logical Reflection and Formalism (context) - Lorenzen - 1958
3 Uber definitionsbereiche von Funktionen (context) - Brouwer - 1927
3 Notes on Gelfand's theory (context) - De Bruijn, Van Der Meiden - 1968
1 Workshop on the semantics of Programming Languages (context) - Martin-Lof - 1983
1 An open induction principle (context) - Raoult - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.chalmers.se.html): More
Variable Sets and Functions Framework for Conceptual.. - Diskin, Cadish (1995) (Correct)
A Definitional Approach to Functional Logic Programming - Torgersson (1996) (Correct)
The Hahn-Banach Theorem in Type Theory - Cederquist, Coquand, Negri (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC