Open Access
Translator Disclaimer
2010 Embeddings of Computable Structures
Asher M. Kach, Oscar Levin, Reed Solomon
Notre Dame J. Formal Logic 51(1): 55-68 (2010). DOI: 10.1215/00294527-2010-004

Abstract

We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.

Citation

Download Citation

Asher M. Kach. Oscar Levin. Reed Solomon. "Embeddings of Computable Structures." Notre Dame J. Formal Logic 51 (1) 55 - 68, 2010. https://doi.org/10.1215/00294527-2010-004

Information

Published: 2010
First available in Project Euclid: 4 May 2010

zbMATH: 1207.03041
MathSciNet: MR2666569
Digital Object Identifier: 10.1215/00294527-2010-004

Subjects:
Primary: 03C57
Secondary: 03D45

Keywords: computable embedding , strong embedding property , weak domain embedding property , weak embedding property , weak range embedding property

Rights: Copyright © 2010 University of Notre Dame

JOURNAL ARTICLE
14 PAGES


SHARE
Vol.51 • No. 1 • 2010
Back to Top