1521-3870/asset/2256_left.gif?v=1&s=becebab9c3e85769a14b145f17b8e337848bc48b)
1521-3870/asset/2256_right.gif?v=1&s=6d251fa351b8e0943ed3dc42b2beb251d4cbfa3e)
Original Paper
Computability on Regular Subsets of Euclidean Space
Article first published online: 14 OCT 2002
DOI: 10.1002/1521-3870(200210)48:1+<157::AID-MALQ157>3.0.CO;2-4
© 2002 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
Issue
1521-3870/asset/cover.gif?v=1&s=3df32dbed8d9153ac6eafe1eaa786854b9b48345 "Mathematical Logic Quarterly")
Mathematical Logic Quarterly
Supplement: Mathematical Logic Quarterly/Supplement 1
Volume 48, Issue Supplement 1, pages 157–181, October 2002
Additional Information
How to Cite
Ziegler, M. (2002), Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly, 48: 157–181. doi: 10.1002/1521-3870(200210)48:1+<157::AID-MALQ157>3.0.CO;2-4
Publication History
- Issue published online: 14 OCT 2002
- Article first published online: 14 OCT 2002
- Manuscript Revised: 13 JUN 2002
- Manuscript Received: 28 DEC 2001
- Abstract
- References
- Cited By
Keywords:
- Computability;
- Recursive Analysis;
- Regular Sets
Abstract
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to pairs of ‘basic’ ones. They turn out to coincide for full-dimensional convex sets; but on the more general class of regular sets, they reveal rather interesting ‘weaker/stronger’ relations. This is in contrast to single real numbers and vectors where all ‘reasonable’ notions coincide.