Skip to main content Accessibility help
×
Home

Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces

  • Li Xiang (a1)

Abstract

Recursively presented topological spaces are topological spaces with a recursive system of basic neighbourhoods. A recursively enumerable (r.e.) open set is a r.e. union of basic neighbourhoods. A set is everywhere r.e. open if its intersection with each basic neighbourhood is r.e. Similarly we define everywhere creative, everywhere simple, everywhere r.e. non-recursive sets and show that there exist sets both with and without these everywhere properties.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces
      Available formats
      ×

Copyright

References

Hide All
[1]Frohlich, A. and Shepherdson, J. C., ‘Effective procedures in field theory’, Phil. Trans. Roy. Soc. London Ser. A 248 (1955), 407432.
[2]Hingston, P., Effectiveness in rings and topology (Ph.D. Dissertation, Monash University, 1983).
[3]Hingston, P., ‘Non-complemented open Sets in effective topologoy’, J. Austral. Math. Soc. (Series A), to appear.
[4]Kalantan, I. and Leggett, A., ‘Simplicity in effective topology’, J. Symbolic Logic 47 (1982), 169183.
[5]Kalantari, I. and Leggett, A., ‘Maximality in effective topology’, J. Symbolic Logic 48 (1983), 100112.
[6]Kalantari, I. and Remmel, J. B., ‘Degrees of unsolvability in effective topology’, J. Symbolic Logic 48 (1983), 610622.
[7]Kalantari, I. and Retzlaff, A., ‘Recursive constructions in topological spaces’, J. Symbolic Logic 44 (1979), 609625.
[8]Kalantari, I. and Weitkamp, G., ‘Effective topological spaces I: a definability theory’, Ann. Pure Appl. Logic 29 (1985), 127.
[9]Kalantari, I. and Weitkamp, G., ‘Effective topolgical spaces II: a hierarchy’, Ann. Pure Appl. Logic 29 (1985), 207224.
[10]Kalantari, I. and Weitkamp, G., ‘Effective topological spaces III: forcing and definability’, Ann. Pure Appl. Logic, to appear.
[11]Metaiddes, G. and Nerode, A., Recursion theory and algebra, pp. 207219 (Lecture Notes in Mathematics 450, Springer, 1975).
[12]Rabin, M. O., ‘Computable algebra, general theory and theory of computable fields’, Trans. Amer. Math. Soc. 95 (1960), 341360.
[13]Rogers, H. Jr, Theory of recursive functions and effective computability (McGraw-Hill, 1967).
[14]Shoenfield, J. R., Degrees of unsolvability (North-Holland, 1971).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

Related content

Powered by UNSILO

Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces

  • Li Xiang (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.