Singular coverings and non‐uniform notions of closed set computability
Abstract
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskiĭ, Tseĭtin, Kreisel, and Lacombe have asserted the existence of non-empty co-r. e. closed sets devoid of computable points: sets which are even “large” in the sense of positive Lebesgue measure.This leads us to investigate for various classes of computable real subsets whether they always contain a computable pointOther Versions
No versions found
My notes
Similar books and articles
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou -1996 -Mathematical Logic Quarterly 42 (1):379-409.
Conditional computability of real functions with respect to a class of operators.Ivan Georgiev &Dimiter Skordev -2013 -Annals of Pure and Applied Logic 164 (5):550-565.
Computability of measurable sets via effective topologies.Yongcheng Wu &Decheng Ding -2006 -Archive for Mathematical Logic 45 (3):365-379.
Computable operators on regular sets.Martin Ziegler -2004 -Mathematical Logic Quarterly 50 (4-5):392-404.
Approaches to Effective Semi‐Continuity of Real Functions.Xizhong Zheng,Vasco Brattka &Klaus Weihrauch -1999 -Mathematical Logic Quarterly 45 (4):481-496.
Degree spectra of real closed fields.Russell Miller &Victor Ocasio González -2019 -Archive for Mathematical Logic 58 (3-4):387-411.
Approximate decidability in euclidean spaces.Armin Hemmerling -2003 -Mathematical Logic Quarterly 49 (1):34-56.
Difference sets and computability theory.Rod Downey,Zoltán Füredi,Carl G. Jockusch &Lee A. Rubel -1998 -Annals of Pure and Applied Logic 93 (1-3):63-72.
Limitwise monotonic sets of reals.Marat Faizrahmanov &Iskander Kalimullin -2015 -Mathematical Logic Quarterly 61 (3):224-229.
Analytics
Added to PP
2013-12-01
Downloads
41 (#607,813)
6 months
5 (#861,124)
2013-12-01
Downloads
41 (#607,813)
6 months
5 (#861,124)
Historical graph of downloads
How can I increase my downloads?Citations of this work
The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma.Vasco Brattka,Guido Gherardi &Alberto Marcone -2012 -Annals of Pure and Applied Logic 163 (6):623-655.
Computable neighbourhoods of points in semicomputable manifolds.Zvonko Iljazović &Lucija Validžić -2017 -Annals of Pure and Applied Logic 168 (4):840-859.
The cohesive principle and the Bolzano‐Weierstraß principle.Alexander P. Kreuzer -2011 -Mathematical Logic Quarterly 57 (3):292-298.
Connected choice and the Brouwer fixed point theorem.Vasco Brattka,Stéphane Le Roux,Joseph S. Miller &Arno Pauly -2019 -Journal of Mathematical Logic 19 (1):1950004.
Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra.Martin Ziegler -2012 -Annals of Pure and Applied Logic 163 (8):1108-1139.
References found in this work
Effective Borel measurability and reducibility of functions.Vasco Brattka -2005 -Mathematical Logic Quarterly 51 (1):19-44.
The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng &Klaus Weihrauch -2001 -Mathematical Logic Quarterly 47 (1):51-66.
Ensembles Récursivement Mesurable et Ensembles Récursivement Ouverts ou Fermés.Georg Kreisel &Daniel Lacombe -1966 -Journal of Symbolic Logic 31 (1):133-133.
Computable operators on regular sets.Martin Ziegler -2004 -Mathematical Logic Quarterly 50 (4-5):392-404.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-54b44b69b7-bbztg uwo