Simplicity in effective topology

Journal of Symbolic Logic 47 (1):169-183 (1982)
  Copy   BIBTEX

Abstract

The recursion-theoretic study of mathematical structures other thanωis now a field of much activity. Analysis and algebra are two such structures which have been studied for their effective contents. Studies in analysis began with the work of Specker on nonconstructive proofs in analysis [16] and in Lacombe's inspiring notes on relevant notions of recursive analysis [8]. Studies in algebra originated in the work of Frolich and Shepherdson on effective extensions of explicit fields [1] and in Rabin's study of computable fields [15]. Equipped with the richness of modern techniques in recursion theory, Metakides and Nerode [11]–[13] began investigating the effective content of vector spaces and fields; these studies have been extended by Kalantari, Remmel, Retzlaff, Shore and others.Kalantari and Retzlaff [5] began a foundational inquiry into effectiveness in topological spaces. They consider a topological spaceXwith a countable basis ⊿ for the topology. The space isfully effective, that is, the basis elements are coded intoωand the operation of intersection of basis elements and the relation of inclusion among them are both computable. Similar to, the lattice of recursively enumerable subsets ofω, the collection of r.e. open subsets ofXforms a latticeℒunder the usual operations of union and intersection.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

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

On effective topological spaces.Dieter Spreen - 1998 - Journal of Symbolic Logic 63 (1):185-221.
What is the problem of simplicity?Elliott Sober - 2001 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference and Modelling: Keeping It Sophisticatedly Simple. New York: Cambridge University Press. pp. 13-32.
Simplicity.Elliott Sober - 1975 - Oxford: Clarendon Press.
Zeeman-göbel topologies.Adrian Heathcote - 1988 - British Journal for the Philosophy of Science 39 (2):247-261.
Maximality in effective topology.Iraj Kalantari & Anne Leggett - 1983 - Journal of Symbolic Logic 48 (1):100-112.

Analytics

Added to PP
2009-01-28

Downloads
64 (#258,247)

6 months
10 (#306,562)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.
Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.

Add more references