Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I

Annals of Pure and Applied Logic 93 (1-3):125-151 (1998)
  Copy   BIBTEX

Abstract

In this paper we develop a point-free approach to the study of topological spaces and functions on them, establish platforms for both and present some findings on recursive points. In the first sections of the paper, we obtain conditions under which our approach leads to the generation of ideal objects with which mathematicians work. Next, we apply the effective version of our approach to the real numbers, and make exact connections to the classical approach to recursive reals. In the succeeding sections of the paper, we introduce machinery to produce functions on topological spaces and find succinct conditions which will be effectivized in our sequel

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A blend of methods of recursion theory and topology.Iraj Kalantari & Larry Welch - 2003 - Annals of Pure and Applied Logic 124 (1-3):141-178.
Topological reasoning and the logic of knowledge.Andrew Dabrowski, Lawrence S. Moss & Rohit Parikh - 1996 - Annals of Pure and Applied Logic 78 (1-3):73-110.
Density and Baire category in recursive topology.Iraj Kalantari & Larry Welch - 2004 - Mathematical Logic Quarterly 50 (4-5):381-391.
Dynamic topological S5.Philip Kremer - 2009 - Annals of Pure and Applied Logic 160 (1):96-116.
Topologies and free constructions.Anna Bucalo & Giuseppe Rosolini - 2013 - Logic and Logical Philosophy 22 (3):327-346.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.

Analytics

Added to PP
2014-01-16

Downloads
28 (#788,995)

6 months
6 (#825,551)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Analysis without actual infinity.Jan Mycielski - 1981 - Journal of Symbolic Logic 46 (3):625-633.
A survey of lattices of re substructures.Anil Nerode & Jeffrey Remmel - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--323.
On the Definition of Computable Function of a Real Variable.J. C. Shepherdson - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):391-402.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.

View all 21 references / Add more references