- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On a metric generalization of the Tt-degrees and effective dimension theory
Journal of Symbolic Logic 84 (2):726-749 (2019)
Abstract
In this article, we study an analogue of tt-reducibility for points in computable metric spaces. We characterize the notion of the metric tt-degree in the context of first-level Borel isomorphism. Then, we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension theory.Other Versions
No versions found
My notes
Similar books and articles
Effective Borel measurability and reducibility of functions.Vasco Brattka - 2004 - Mathematical Logic Quarterly 51 (1):19-44.
Continuous reducibility and dimension of metric spaces.Philipp Schlicht - 2018 - Archive for Mathematical Logic 57 (3-4):329-359.
Computably Compact Metric Spaces.Rodney G. Downey & Alexander G. Melnikov - 2023 - Bulletin of Symbolic Logic 29 (2):170-263.
Computable dimension for ordered fields.Oscar Levin - 2016 - Archive for Mathematical Logic 55 (3-4):519-534.
Effective Borel degrees of some topological functions.Guido Gherardi - 2006 - Mathematical Logic Quarterly 52 (6):625-642.
Computability Theory on Polish Metric Spaces.Teerawat Thewmorakot - 2023 - Bulletin of Symbolic Logic 29 (4):664-664.
Computable Topological Presentations.Mathieu Hoyrup, Alexander Melnikov & N. G. Keng Meng - forthcoming - Journal of Symbolic Logic:1-20.
A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one.Chris J. Conidis - 2012 - Journal of Symbolic Logic 77 (2):447-474.
Comparing Computability in Two Topologies.Djamel Eddine Amir & Mathieu Hoyrup - 2024 - Journal of Symbolic Logic 89 (3):1232-1250.
Computable and continuous partial homomorphisms on metric partial algebras.Viggo Stoltenberg-Hansen & John V. Tucker - 2003 - Bulletin of Symbolic Logic 9 (3):299-334.
Analytics
Added to PP
2019-03-14
Downloads
73 (#803,521)
6 months
19 (#605,215)
2019-03-14
Downloads
73 (#803,521)
6 months
19 (#605,215)
Historical graph of downloads
References found in this work
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
Unified characterizations of lowness properties via Kolmogorov complexity.Takayuki Kihara & Kenshi Miyabe - 2015 - Archive for Mathematical Logic 54 (3-4):329-358.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation