The isometry degree of a computable copy of ℓ p 1-Reference-Cited by-同舟云学术

The isometry degree of a computable copy of ℓ p 1

Published:2019-06-17 Issue:2 Volume:8 Page:179-189
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

McNicholl Timothy H.¹,Stull Donald M.²

Affiliation:

1. Department of Mathematics, Iowa State University, Ames, IA, USA. mcnichol@iastate.edu

2. Campus scientifique, Laboratoire lorrain de recherche en informatique et ses applications, BP 239, 54506 Vandoeuvre-lés Nancy Cedex, France. donald.stull@inria.fr

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference15 articles.

1. Degrees that are not degrees of categoricity;Anderson;Notre Dame Journal of Formal Logic,2016

2. S. Banach, Theory of Linear Operations, North-Holland Mathematical Library, Vol. 38, North-Holland Publishing Co., Amsterdam, 1987, Translated from the French by F. Jellett, with comments by A. Pełczyński and Cz. Bessaga.

3. S.B. Cooper, Computability Theory, Chapman & Hall/CRC, Boca Raton, FL, 2004.

4. Degrees of categoricity and the hyperarithmetic hierarchy;Csima;Notre Dame J. Form. Log.,2013

5. Degrees of categoricity of computable structures;Fokina;Arch. Math. Logic,2010

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ideal presentations and numberings of some classes of effective quasi-Polish spaces;Computability;2024-01-29

2. DEGREE SPECTRA OF HOMEOMORPHISM TYPE OF COMPACT POLISH SPACES;The Journal of Symbolic Logic;2023-12-11

3. COMPUTABLE PRESENTATIONS OF C*-ALGEBRAS;The Journal of Symbolic Logic;2023-04-20

4. Descriptive complexity of qcb0-spaces;Theoretical Computer Science;2023-02

5. Enumerating Classes of Effective Quasi-Polish Spaces;Revolutions and Revelations in Computability;2022