Mathematical Logic Quarterly 47 (1):51-66 (2001)
| Abstract |
A real number x is computable iff it is the limit of an effectively converging computable sequence of rational numbers, and x is left computable iff it is the supremum of a computable sequence of rational numbers. By applying the operations “sup” and “inf” alternately n times to computable sequences of rational numbers we introduce a non-collapsing hierarchy {Σn, Πn, Δn : n ∈ ℕ} of real numbers. We characterize the classes Σ2, Π2 and Δ2 in various ways and give several interesting examples
|
| Keywords | Computable real number Recursively approximable real number Arithmetical hierarchy |
| Categories | (categorize this paper) |
| DOI | 10.1002/1521-3870(200101)47:1 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
No references found.
Citations of this work BETA
Fermat’s Last Theorem Proved in Hilbert Arithmetic. I. From the Proof by Induction to the Viewpoint of Hilbert Arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (7):1-57.
Singular Coverings and Non‐Uniform Notions of Closed Set Computability.Stéphane Le Roux & Martin Ziegler - 2008 - Mathematical Logic Quarterly 54 (5):545-560.
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.
Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
Some Remarks on Real Numbers Induced by First-Order Spectra.Sune Kristian Jakobsen & Jakob Grue Simonsen - 2016 - Notre Dame Journal of Formal Logic 57 (3):355-368.
View all 7 citations / Add more citations
Similar books and articles
Monotonically Computable Real Numbers.Robert Rettinger, Xizhong Zheng, Romain Gengler & Burchard von Braunmühl - 2002 - Mathematical Logic Quarterly 48 (3):459-479.
The Approximation Structure of a Computably Approximable Real.George Barmpalias - 2003 - Journal of Symbolic Logic 68 (3):885-922.
Primitive Recursive Real Numbers.Qingliang Chen, Kaile Kaile & Xizhong Zheng - 2007 - Mathematical Logic Quarterly 53 (4):365-380.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
The Hausdorff-Ershov Hierarchy in Euclidean Spaces.Armin Hemmerling - 2006 - Archive for Mathematical Logic 45 (3):323-350.
H‐Monotonically Computable Real Numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Characterizations of the Class ~2^T^a Over Euclidean Spaces.Armin Hemmerling - 2004 - Mathematical Logic Quarterly 50 (4):507.
Primitive Recursive Real Numbers.Qingliang Chen, Kaile Su & Xizhong Zheng - 2007 - Mathematical Logic Quarterly 53 (4‐5):365-380.
Wittgenstein and the Real Numbers.Daesuk Han - 2010 - History and Philosophy of Logic 31 (3):219-245.
Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
Dummett’s Argument for the Indefinite Extensibility of Set and Real Number.Peter Clark - 1998 - Grazer Philosophische Studien 55 (1):51-63.
The Discrete Parts of Approximately Decidable Sets in Euclidean Spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (4):428.
Analytics
Added to PP index
2013-12-01
Total views
17 ( #635,784 of 2,505,771 )
Recent downloads (6 months)
1 ( #416,705 of 2,505,771 )
2013-12-01
Total views
17 ( #635,784 of 2,505,771 )
Recent downloads (6 months)
1 ( #416,705 of 2,505,771 )
How can I increase my downloads?
Downloads
