On a Computable Presentation of Low Linear Orderings
-
Published:2018-11
Issue:9
Volume:39
Page:1453-1459
-
ISSN:1995-0802
-
Container-title:Lobachevskii Journal of Mathematics
-
language:en
-
Short-container-title:Lobachevskii J Math
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference17 articles.
1. R. I. Soare, Recursively Enumerable Sets and Degrees (Springer, Heidelberg, 1987), Vol. 18.
2. R. G. Downey and C. G. Jockusch, Jr., “Every low Boolean algebra is isomorphic to a recursive one,” Proc. Am. Math. Soc. 122, 871–880 (1994).
3. J. Thurber, “Every low2 Boolean algebra has a recursive copy,” Proc. Am. Math. Soc. 123, 3859–3866 (1995).
4. J. F. Knight and M. Stob, “Computable Boolean algebras,” J. Symb. Logic. 65, 1605–1623 (2000). doi 10.2307/2695066
5. K. Harris and A. Montalban, “Boolean algebra approximations,” Trans. Am. Math. Soc. 366, 5223–5256 (2014). doi 10.1090/S0002-9947-2014-05950-3