Computably Isometric Spaces

Journal of Symbolic Logic 78 (4):1055-1085 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.
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.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
Computably Enumerable Reals and Uniformly Presentable Ideals.S. A. Terwijn & R. Downey - 2002 - Mathematical Logic Quarterly 48 (S1):29-40.
1-Generic splittings of computably enumerable degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.
Complementing cappable degrees in the difference hierarchy.Rod Downey, Angsheng Li & Guohua Wu - 2004 - Annals of Pure and Applied Logic 125 (1-3):101-118.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
A δ02 set with barely σ02 degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
Splitting theorems and the jump operator.R. G. Downey & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 94 (1-3):45-52.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,409,222)

6 months
3 (#1,042,169)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

Citations of this work

Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Maximal computability structures.Zvonko Iljazović & Lucija Validžić - 2016 - Bulletin of Symbolic Logic 22 (4):445-468.

Add more citations

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.
Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.

View all 6 references / Add more references