Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-16T16:16:25.919Z Has data issue: false hasContentIssue false
  • English
  • Français

Maximality in effective topology

Published online by Cambridge University Press:  12 March 2014

Iraj Kalantari  and
Anne Leggett
Iraj Kalantari
Affiliation:
Western Illinois University, Macomb, Illinois 61455
Get access Rights & Permissions [Opens in a new window]

Extract

In this paper we continue the study of the structure of the lattice of recursively enumerable (r.e.) open subsets of a topological space. Work in this approach to effective topology began in Kalantari and Retzlaff [5] and continued in Kalantari [2], Kalantari and Leggett [3] and Kalantari and Remmel [4]. Studies in effectiveness of results in structures other than integers began with the work of Specker [17] and Lacombe [8] on effective analysis.

The renewed activity in the study of the effective content of mathematical structures owes much to Nerode's program and Metakides' and Nerode's [11], [12] work on vector spaces and fields. These studies have been extended by Kalantari, Remmel, Retzlaff, Shore and Smith. Similar studies on the effective content of other mathematical structures have been conducted. These include work on topological vector spaces, boolean algebras, linear orderings etc.

Kalantari and Retzlaff [5] began a study of effective topological spaces by considering a topological space with a countable basis ⊿ for the topology. The space X is to be fully effective; that is, the basis elements are coded into ω and the operations of intersection of basis elements and the relation of inclusion among them are both computable. An r.e. open subset of X is then represented as the union of basic open sets whose codes lie in an r.e. subset of ω.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 48 , Issue 1 , March 1983 , pp. 100 - 112
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Frölich, A. and Shepherdson, J.C., Effective procedures in field theory, Philosophical Transactions of the Royal Society of London, Series A, vol. 284 (1955), pp. 407–432Google Scholar
[2]Kalantari, I., Major subsets in effective topology, Proceedings of the European Summer Meeting of the ASL, Patras, Greece, 1980 (to appear).Google Scholar
[3]Kalantari, I. and Leggett, A., Simplicity in effective topology, this Journal, vol. 47 (1982), pp. 169–183.Google Scholar
[4]Kalantari, I. and Remmel, J., Degrees of unsolvability in effective topology, this Journal (to appear).Google Scholar
[5]Kalantari, I. and Retzlafe, A., Recursive constructions in topological spaces, this Journal, vol. 44 (1979), pp. 609–625.Google Scholar
[6]Lachlan, A. H., On the lattice of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37.CrossRefGoogle Scholar
[7]Lachlan, A. H., The elementary theory of recursively enumerable sets, Duke Mathematical Journal, vol. 35 (1968), pp. 123–146.CrossRefGoogle Scholar
[8]Lacombe, D., Les ensembles récursivement ouverts ou fermés, et leurs applications à l'analyse recursive, Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences (Paris), vol. 245 (1957), pp. 1040–1043; D. Lacombe, Les ensembles récursivement ouverts ou fermés, et leurs applications à l'analyse recursive, Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences (Paris), vol. 246 (1958), pp. 28–31.Google Scholar
[9]Lerman, M., Congruence relations, filters, ideals and definability in lattice of α-recursively enumerable sets, this Journal, vol. 41 (1976), pp. 405–418.Google Scholar
[10]Lerman, M. and Soare, R.I., A decidable fragment of the elementary theory of the lattice of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 257 (1980), pp. 1–37.CrossRefGoogle Scholar
[11]Metakides, G. and Nerode, A., Recursion theory and algebra, Algebra and logic, Lecture Notes in Mathematics, vol. 450, Springer-Verlag, Berlin, 1975, pp. 209–219.CrossRefGoogle Scholar
[12]Metakides, G., Recursively enumerable vector spaces, Annals of Mathematical Logic, vol. 11 (1977), pp. 147–171.CrossRefGoogle Scholar
[13]Metakides, G., Effective content of field theory, Annals of Mathematical Logic, vol. 17 (1979), pp. 289–320.CrossRefGoogle Scholar
[14]Post, E.L., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.CrossRefGoogle Scholar
[15]Rabin, M.O., Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 341–360.Google Scholar
[16]Shore, R., Nowhere simple sets and the lattice of recursively enumerable sets, this Journal, vol. 43 (1978), pp. 322–330.Google Scholar
[17]Specker, E., Nicht konstraktiv beweisbare Sätze der Analysis, this Journal, vol. 14 (1949), pp. 145–148.Google Scholar