Abstract
The continuous or countable functionals form a class of objects which are finitely approximable — they can be completely described by a set of (hereditarily) finite sets (approximations). We introduce and study a wider class of objects — sets, functions, and relations — all of which lay claim to a notion of finite approximability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dugundji, J., Topology, Allyn and Bacon, Boston, 1966, xvi + 447 pp.
Hinman, P.G., Recursion-Theoretic Hierarchies, Perspectives in Mathematical Logic, Springer-Verlag, Berlin-Heidelberg-New York, 1978, xii + 480 pp.
Hyland, J.M.E., Filter spaces and continuous functionals, Annals of Mathematical Logic 16 (1979) 101–143.
Kechris, A.S. and Moschovakis, Y.N., Recursion in higher types, Handbook of Mathematical Logic, ed. K.J. Barwise, North-Holland, Amsterdam, 1977, 681–737.
Kleene, S.C., Countable functionals, Constructivity in Mathematics, ed. A. Heyting. North-Holland, Amsterdam, 1959, 81–100.
Kreisel, G., Interpretation of analysis by means of functionals of finite type, Constructivity in Mathematics, ed. A. Heyting, North-Holland, Amsterdam, 1959, 101–128.
Normann, D., Set recursion, Generalized Recursion Theory II, ed. J.E. Fenstad, R.O. Gandy, and G.E. Sacks, North-Holland, Amsterdam, 1978, 303–320.
Normann, D., Recursion on the countable functionals, Lecture Notes in Mathematics 811, Springer-Verlag, Berlin-Heidelberg-New York, 1980, viii + 191 pp.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Hinman, P.G. (1984). Finitely approximable sets. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099488
Download citation
DOI: https://doi.org/10.1007/BFb0099488
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive