# Metric spaces are universal for bi-interpretation with metric structures

@article{Hanson2021MetricSA,
title={Metric spaces are universal for bi-interpretation with metric structures},
author={James Hanson},
journal={Ann. Pure Appl. Log.},
year={2021},
volume={174},
pages={103204}
}
• James Hanson
• Published 27 March 2021
• Mathematics, Computer Science
• Ann. Pure Appl. Log.
2 Citations
• James Hanson
• Mathematics, Computer Science
J. Log. Comput.
• 2021
In this paper we introduce and characterize two ‘analog reducibility’ notions for $[0,1]$-valued oracles on $\omega$ obtained by applying the syntactic characterizations of Turing and enumeration
We explore approximate categoricity in the context of distortion systems, introduced in our previous paper, which are a mild generalization of perturbation systems, introduced by Ben Yaacov. We

## References

SHOWING 1-8 OF 8 REFERENCES

• Mathematics
Forum of Mathematics, Sigma
• 2022
The point degree spectrum of a represented space is introduced as a substructure of the Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees, continuous degrees, and so on and creates a connection among various areas of mathematics including computability theory, descriptive set theory, infinite dimensional topology and Banach space theory.
We present an adaptation of continuous first order logic to unbounded metric structures. This has the advantage of being closer in spirit to C. Ward Henson's logic for Banach space structures than
We give a general framework for the treatment of perturbations of types and structures in continuous logic, allowing to specify which parts of the logic may be perturbed. We prove that separable,
• Mathematics
• 2007
We observe that certain classical results of first order model theory fail in the context of continuous first order logic. We argue that this happens since finite tuples in a continuous structure may
• K. Weihrauch
• Education
Texts in Theoretical Computer Science. An EATCS Series
• 2000
This book provides a solid fundament for studying various aspects of computability and complexity in analysis and is written in a style suitable for graduate-level and senior students in computer science and mathematics.
• Philosophy
• 2010
We develop continuous first order logic, a variant of the logic described by Chang and Keisler (1966). We show that this logic has the same power of expression as the framework of open Hausdorff

• 1993

### Model theory for metric structures

• London Mathematical Society Lecture Note Series
• 2008