- 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
Computably Isometric Spaces
Journal of Symbolic Logic 78 (4):1055-1085 (2013)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
On the complexity of classifying lebesgue spaces.Tyler A. Brown, Timothy H. Mcnicholl & Alexander G. Melnikov - 2020 - Journal of Symbolic Logic 85 (3):1254-1288.
Computably and punctually universal spaces.Ramil Bagaviev, Ilnur I. Batyrshin, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov & Keng Meng Ng - 2025 - Annals of Pure and Applied Logic 176 (1):103491.
Computably Compact Metric Spaces.Rodney G. Downey & Alexander G. Melnikov - 2023 - Bulletin of Symbolic Logic 29 (2):170-263.
Computability Theory on Polish Metric Spaces.Teerawat Thewmorakot - 2023 - Bulletin of Symbolic Logic 29 (4):664-664.
Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
Universal computably enumerable equivalence relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (1):60-88.
A set with barely degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700-1718.
Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets.Robert I. Soare - 1990 - Journal of Symbolic Logic 55 (1):356-357.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
Analytics
Added to PP
2016-06-30
Downloads
22 (#1,113,172)
6 months
9 (#543,288)
2016-06-30
Downloads
22 (#1,113,172)
6 months
9 (#543,288)
Historical graph of downloads
Author's Profile
Citations of this work
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Analytic computable structure theory and $$L^p$$Lp -spaces part 2.Tyler Brown & Timothy H. McNicholl - 2020 - Archive for Mathematical Logic 59 (3-4):427-443.
Computable Presentations of C*-Algebras.F. O. X. Alec - 2024 - Journal of Symbolic Logic 89 (3):1313-1338.
On the complexity of the theory of a computably presented metric structure.Caleb Camrud, Isaac Goldbring & Timothy H. McNicholl - 2023 - Archive for Mathematical Logic 62 (7):1111-1129.
Computably and punctually universal spaces.Ramil Bagaviev, Ilnur I. Batyrshin, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov & Keng Meng Ng - 2025 - Annals of Pure and Applied Logic 176 (1):103491.
References found in this work
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
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
Server: philpapers-web-6dc498764b-nlds7 uwo