Skip to main content
SpringerLink
Log in

Recursive and r.e. quotient Boolean algebras

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Summary

We prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can be coded into recursive and r.e. quotient Boolean algebras.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [A] Ash, C.J.: A construction for recursive linear orderings. J. Symb. Logic56, 673–683 (1991)

    Google Scholar 

  • [A-J-K] Ash, C.J., Jockusch, C.G., Knight, J.F.: Jumps of orderings. Trans. Am. Math. Soc.319, 573–599 (1990)

    Google Scholar 

  • [F] Feiner, L.: Hierarchies of Boolean algebras. J. Symb. Logic35, 365–374 (1974)

    Google Scholar 

  • [L] Love, J.: M.Sc. Thesis. Monash University, Clayton, Victoria, Australia

  • [M-B] Monk, J.D., Bonnet, R. (eds.): Handbook of Boolean algebras, Vol. 1. Amsterdam: Elsevier 1989

    Google Scholar 

  • [R] Rogers, H.: Theory of recursive functions and effective computability. Cambridge, MA: MIT Press 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Notre Dame, 46556, Notre Dame, Indiana, USA

    John J. Thurber

Authors
  1. John J. Thurber
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Mathematics subject classification (1991): 03C57

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thurber, J.J. Recursive and r.e. quotient Boolean algebras. Arch Math Logic 33, 121–129 (1994). https://doi.org/10.1007/BF01352933

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01352933

Keywords

Search

Navigation