论文信息 - Embeddings of Computable Structures

Embeddings of Computable Structures

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.

Asher M. Kach | Reed Solomon | Oscar Levin

[1] Jussi Ketonen,et al. The Structure of Countable Boolean Algebras , 1978 .

[2] Manuel Lerman,et al. On recursive linear orderings , 1981 .

[3] Asher M. Kach. Embeddings of Computable Linear Orders , 2008 .

[4] Manuel Lerman. Recursive Linear Orderings , 1982 .

[5] Arkadii M. Slinko,et al. Degree spectra and computable dimensions in algebraic structures , 2002, Ann. Pure Appl. Log..

[6] James H. Schmerl,et al. Self-Embeddings of Computable Trees , 2008, Notre Dame J. Formal Log..

[7] A. Nerode,et al. Effective content of field theory , 1979 .

[8] Douglas A. Cenzer,et al. Effective categoricity of equivalence structures , 2006, Ann. Pure Appl. Log..

[9] Denis R. Hirschfeldt,et al. Combinatorial principles weaker than Ramsey's Theorem for pairs , 2007, J. Symb. Log..

[10] Reed Solomon August,et al. Π 01 classes and orderable groups , 2022 .

[11] Joseph Harrison,et al. Recursive pseudo-well-orderings , 1968 .