Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-25T18:13:46.315Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive Boolean algebras with recursive atoms

Published online by Cambridge University Press:  12 March 2014

Jeffrey B. Remmel
Jeffrey B. Remmel*
Affiliation:
University of California, San Diego, La Jolla, California 92093
Get access Rights & Permissions [Opens in a new window]

Extract

A Boolean algebra (henceforth abbreviated B.A.) is said to be recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and ¬ (complement) are partial recursive. Let denote the set of atoms of and denote the ideal generated by the atoms of . Given recursive B.A.s and , we write ≈ if is isomorphic to and ≈r if is recursively isomorphic to , i.e., if there is a partial recursive isomorphism from onto .

Recursive B.A.s have been studied by several authors including Ershov [2], Fiener [3], [4], Goncharov [5], [6], [7], LaRoche [8], Nurtazin [7], and the author [10], [11]. This paper continues a study of the recursion theoretic relationships among , , and the recursive isomorphism type of a recursive B.A. we started in [11]. We refer the reader to [11] for any unexplained notation and definitions. In [11], we were mainly concerned with the possible recursion theoretic properties of the set of atoms in recursive B.A.s. We found that even if we insist that be recursive, there is considerable freedom for the properties of . For example, we showed that if is a recursive B.A. such that is recursive and is infinite, then (i) there exists a recursive B.A. such that and both and are recursive and (ii) for any nonzero r.e. degree δ, there exist recursive B.A.s , , … such that for each i, is of degree δ, is recursive, is immune if i is even and is not immune if i is odd, and no two B.A.s in the sequence are recursively isomorphic.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 46 , Issue 3 , September 1981 , pp. 595 - 616
Copyright
Copyright © Association for Symbolic Logic 1981

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

[1]Alton, D. A., Iterated quotients of the lattice of recursively enumerable sets, Proceedings of the London Mathematical Society, vol. 28 (1974), pp. 1–12.CrossRefGoogle Scholar
[2]Ershov, Y. L., Theorie der Numerierungen. III, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 23 (1977), pp. 289–371.Google Scholar
[3]Fiener, L., Orderings and Boolean algebras not isomorphic to recursive ones, Ph.D. Thesis, M.I.T., Cambridge, 1967.Google Scholar
[4]Fiener, L., Hierarchies of Boolean algebras, this Journal, vol. 35 (1970), pp. 365–373.Google Scholar
[5]Goncharov, S. S., Constructivizable superatomic Boolean algebras, Algebra i Logika, vol. 12 (1975), pp. 264–278.Google Scholar
[6]Goncharov, S. S., Some properties of the constructivization of Boolean algebras, Sibirskiǐ Matematičeskiǐ Žurnal, vol. 16 (1975), pp. 264–278.Google Scholar
[7]Goncharov, S. S. and Nurtazin, A. T., Constructive models of complete solvable theories, Algebra i Logika, vol. 12 (1973), pp. 125–142.Google Scholar
[8]LaRoche, P., Recursively presented Boolean algebras, Notices of the American Mathematical Society, vol. 24 (1977), p. A–552.Google Scholar
[9]Manaster, A. B., and Remmel, J. B., Co-simple higher-order indecomposable isols and Boolean algebras, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (to appear).Google Scholar
[10]Remmel, J. B., Recursively enumerable Boolean algebras, Annals of Mathematical Logic, vol. 14(1978), pp. 75–107.CrossRefGoogle Scholar
[11]Remmel, J. B., Recursive isomorphism types of recursive Boolean algebras, this Journal vol. 46 (1981), pp. 572–594.Google Scholar
[12]Rogers, H. J. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[13]Sacks, G. E., The recursively enumerable degrees are dense, Annals of Mathematics, vol. 80 (1964), pp. 300–312.CrossRefGoogle Scholar
[14]Sikorski, R., Boolean algebras, Academic Press, New York, 1964.Google Scholar
[15]Vaught, R. L., Topics in the theory of arithmetical classes and Boolean algebras, Ph.D. Thesis, University of California, Berkeley, 1954.Google Scholar