Hostname: page-component-7dd5485656-pnlb5 Total loading time: 0.001 Render date: 2025-10-31T12:13:32.647Z Has data issue: false hasContentIssue false
  • English
  • Français

Located sets and reverse mathematics

Published online by Cambridge University Press:  12 March 2014

Mariagnese Giusto  and
Stephen G. Simpson
Mariagnese Giusto
Affiliation:
Dip. di Matematica, Universita di Torino, Via Carlo Alberto 10, 10123 Torino, Italy E-mail: giusto@dm.unito.it
Stephen G. Simpson
Affiliation:
Department of Mathematics, Pennsylvania State University, State College. Pennsylvania 16802, USA E-mail: simpson@math.psu.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

Let X be a compact metric space. A closed set K ⊆ X is located if the distance function d(x, K) exists as a continuous real-valued function on X; weakly located if the predicate d(x, K) > r is allowing parameters. The purpose of this paper is to explore the concepts of located and weakly located subsets of a compact separable metric space in the context of subsystems of second order arithmetic such as RCA0, WKL0 and ACA0. We also give some applications of these concepts by discussing some versions of the Tietze extension theorem. In particular we prove an RCA0 version of this result for weakly located closed sets.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 65 , Issue 3 , September 2000 , pp. 1451 - 1480
Copyright
Copyright © Association for Symbolic Logic 2000

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.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Bishop, Errett and Bridges, Douglas, Constructive analysis, Grundlehren der mathematischen Wissenschaften, Springer-Verlag, 1985, xii + 477 pages.CrossRefGoogle Scholar
[2]Brown, Douglas K., Functional analysis in weak subsystems of second order arithmetic, Ph.D. thesis, The Pennsylvania State University, 1987, vii + 150 pages.Google Scholar
[3]Brown, Douglas K., Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic, Logic and computation (Sieg, W., editor), Contemporary Mathematics, American Mathematical Society, 1990, xiv + 297 pages, pp. 39–50.Google Scholar
[4]Brown, Douglas K. and Simpson, Stephen G., Which set existence axioms are needed to prove the separable Hahn-Banach theorem?, Annals of Pure and Applied Logic, vol. 31 (1986), pp. 123–144.CrossRefGoogle Scholar
[5]Engelking, Ryszard, General topology, Heldermann, Berlin, 1989, revised and completed edition, viii + 529 pages.Google Scholar
[6]Giusto, Mariagnese, Topology and analysis in reverse mathematics, Ph.D. thesis, Università di Torino, 1998.Google Scholar
[7]Giusto, Mariagnese and Marcone, Alberto, Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic, Archive for Mathematical Logic, vol. 37 (1998), pp. 343–362.CrossRefGoogle Scholar
[8]Jockusch, Carl G. Jr., classes and Boolean combinations of recursively enumerable sets, this Journal, vol. 39 (1974), pp. 95–96.Google Scholar
[9]Jockusch, Carl G. Jr., Degrees offunctions with no fixed points, Logic, methodology and philosophy of science VIII (Fenstad, J.-E., Frolov, I. T., and Hilpinen, R., editors), Studies in Logic and the Foundations of Mathematics, Elsevier, 1989, xvii + 702 pages, pp. 191–201.Google Scholar
[10]Kechris, Alexander S., Classical descriptive set theory, Graduate Texts in Mathematics, Springer-Verlag, 1985, xviii + 402 pages.Google Scholar
[11]Rogers, Hartley Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967, xix + 482 pages.Google Scholar
[12]Simpson, Stephen G., Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?, this Journal, vol. 49 (1984), pp. 783–802.Google Scholar
[13]Simpson, Stephen G., Subsystems of Z2 and reverse mathematics, Proof theory (Takeuti, Gaisi, editor), Studies in Logic and Foundations of Mathematics, Elsevier, 2nd ed., 1987, x + 490 pages, pp. 434–448.Google Scholar
[14]Simpson, Stephen G., Finite and countable additivity, preprint, 8 pages, to appear, November 1996.Google Scholar
[15]Simpson, Stephen G., Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, 1998, XIV + 445 pages.Google Scholar
[16]Soare, Robert I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, 1987, xviii + 437 pages.CrossRefGoogle Scholar
[17]Yu, Xiaokang and Simpson, Stephen G., Measure theory and weak Konig's lemma. Archive for Mathematical Logic, vol. 30 (1990), pp. 171–180.CrossRefGoogle Scholar