Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-28T16:05:03.230Z Has data issue: false hasContentIssue false
  • English
  • Français

Computable Boolean algebras

Published online by Cambridge University Press:  12 March 2014

Julia F. Knight  and
Michael Stob
Julia F. Knight
Affiliation:
Department of Mathematics, University of Notre Dame, Notre Dame. IN 46556, USA, E-mail:[email protected]
Michael Stob
Affiliation:
Department of Mathematics, University of Notre Dame, Notre Dame. IN 46556, USA, E-mail:[email protected]
Get access Rights & Permissions [Opens in a new window]

Extract

Feiner [F] showed that a Boolean algebra need not have a computable copy (see also [T2]). Downey and Jockusch [D-J] showed that every low Boolean algebra does have a computable copy. Thurber [T3], showed that every low2 Boolean algebra has a computable copy. Here we show that every Boolean algebra which is low3, or even low4, has a computable copy.

The results of [D-J] and [T3] were obtained by passing to linear orderings. In [D-J], there is an embedding theorem saying that any linear ordering which is with the successor relation as an added predicate can be embedded in a slightly larger linear ordering which is computable. An isomorphism theorem of Remmel [R] is used to show that the interval algebras of the two linear orderings are isomorphic (except in a trivial case). In [T3], there is an embedding theorem saying that any linear ordering which is with certain added predicates can be embedded in one which is with successor. Again the isomorphism theorem of Remmel is used to show that the interval algebras are isomorphic (except in a trivial case).

Here, instead of passing to linear orderings, we work directly with Boolean algebras. We begin with a review of the known results. We re-formulate the embedding theorems of Downey-Jockusch and Thurber in terms of Boolean algebras. We extract from Remmel's isomorphism theorem some information on complexity. In this way, we show that a low Boolean algebra is isomorphic to a computable one by an isomorphism which is , at worst, and the same is true for a low2 Boolean algebra.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 65 , Issue 4 , December 2000 , pp. 1605 - 1623
Copyright
Copyright © Association for Symbolic Logic 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[D-J]Downey, R. and Jockusch, C. G., Every low Boolean algebra is isomorphic to a recursive one, Proceedings of the American Mathematical Society, vol. 122 (1994), pp. 871–880.CrossRefGoogle Scholar
[F]Feiner, L. J., Hierarchies of Boolean algebras, this Journal, vol. 35 (1970), pp. 365–373.Google Scholar
[M-B]Monk, J. D. and Bonnet, R. (editors), Handbook of Boolean algebras, vol. I. II, III.Google Scholar
[R]Remmel, J. B., Recursive Boolean algebras with recursive atoms, this Journal, vol. 46 (1981), pp. 595–615.Google Scholar
[Ti]Thurber, J. J., Ph.D. thesis. University of Notre Dame.Google Scholar
[T2]Thurber, J. J., Recursive and r.e. quotient Boolean algebras, Archive for Mathematical Logic, vol. 33 (1994), pp. 121–129.CrossRefGoogle Scholar
[T3]Thurber, J. J., Every low2 Boolean algebra has a recursive copy, Proceedings of the American Mathematical Society, vol. 123 (1995), pp. 3859–3866.Google Scholar
[V]Vaught, R. L., Topics in the theory of arithmetical classes and Boolean algebras, Ph.D. thesis, University of California, Berkeley, 1954.Google Scholar