ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Annals of Pure and Applied Logic
Volume 124, Issues 1-3, 15 December 2003, Pages 71-106
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (367 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0168-0072(03)00052-6    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Published by Elsevier Science B.V.

Inductively generated formal topologies

Thierry CoquandCorresponding Author Contact Information, E-mail The Corresponding Author, a, Giovanni SambinE-mail The Corresponding Author, b, Jan SmithE-mail The Corresponding Author, a and Silvio ValentiniE-mail The Corresponding Author, b

a Department of Computing Science, Chalmers University, S-41296, Göteborg, Sweden b Dip. di Matematica Pura ed Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

Received 1 April 2001; 
revised 1 April 2003; 
accepted 12 May 2003;
Communicated by I. Moerdijk 
Available online 17 September 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Formal topology aims at developing general topology in intuitionistic and predicative mathematics. Many classical results of general topology have been already brought into the realm of constructive mathematics by using formal topology and also new light on basic topological notions was gained with this approach which allows distinction which are not expressible in classical topology.

Here we give a systematic exposition of one of the main tools in formal topology: inductive generation. In fact, many formal topologies can be presented in a predicative way by an inductive generation and thus their properties can be proved inductively. We show however that some natural complete Heyting algebra cannot be inductively defined.

Author Keywords: Inductive definitions; Formal topology; Predicative systems

Mathematical subject codes: 03F65; 06D22; 54A05


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.