Mathematical Logic Quarterly 48 (S1):157-181 (2002)
| 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
|
| Keywords | Regular Sets Recursive Analysis Computability |
| Categories | (categorize this paper) |
| DOI | 10.1002/1521-3870(200210)48:1 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 70,214
External links
(no proxy) Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Nicht Konstruktiv Beweisbare Sätze der Analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
Representations of the Real Numbers and of the Open Subsets of the Set of Real Numbers.Klaus Weihrauch & Christoph Kreitz - 1987 - Annals of Pure and Applied Logic 35 (3):247-260.
Citations of this work BETA
No citations found.
Similar books and articles
Computability of Measurable Sets Via Effective Topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
A Necessary Relation Algebra for Mereotopology.Ivo DÜntsch, Gunther Schmidt & Michael Winter - 2001 - Studia Logica 69 (3):381 - 409.
Computability and Continuity in Computable Metric Partial Algebras Equipped with Computability Structures.F. Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Computability of Measurable Sets Via Effective Metrics.Yongcheng Wu & Decheng Ding - 2005 - Mathematical Logic Quarterly 51 (6):543-559.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Singular Coverings and Non‐Uniform Notions of Closed Set Computability.Stéphane Le Roux & Martin Ziegler - 2008 - Mathematical Logic Quarterly 54 (5):545-560.
Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Primitive Recursive Analogues of Regular Cardinals Based on Ordinal Representation Systems for KPi and KPM.Osamu Takaki - 2005 - Archive for Mathematical Logic 44 (6):689-709.
Computability of Self‐Similar Sets.Hiroyasu Kamo & Kiko Kawamura - 1999 - Mathematical Logic Quarterly 45 (1):23-30.
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2002 - Cambridge University Press.
Analytics
Added to PP index
2013-12-01
Total views
23 ( #492,912 of 2,507,555 )
Recent downloads (6 months)
1 ( #416,983 of 2,507,555 )
2013-12-01
Total views
23 ( #492,912 of 2,507,555 )
Recent downloads (6 months)
1 ( #416,983 of 2,507,555 )
How can I increase my downloads?
Downloads
