Skip to main content
Log in

Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra

  • Published:
Algebra and Logic Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature cited

  1. C. J. Ash and A. Nerode, "Intrinsically recursive relations," in: "Aspects of Effective Algebra," U.D.A. Book Co., Yara Glen, Australia (1981), pp. 26–41.

    Google Scholar 

  2. E. Barker, "Intrinsically Σ 02 -relations," Preprint, Monash University, Clayton (1987).

    Google Scholar 

  3. Yu. G. Ventsov, "Non-uniform autostability of models," Algebra Logika,26, No. 6, 684–714 (1987).

    Google Scholar 

  4. E. Barker, "Intrinsically Σ 0 -relations," Preprint, Monash University, Clayton (1988).

    Google Scholar 

  5. C. J. Ash, J. Knight, M. Manasse, and T. A. Slaman, "Generic copies of countable structures," Logic paper, No. 63, Monash University, Clayton (1988).

    Google Scholar 

  6. A. Nerode and J. B. Remmel, "A survey of the lattices of r.e. substructures," in: Proc. Symp. Pure Math.,42, 323–376 (1985).

    Google Scholar 

  7. S. P. Odintsov, "On the lattice of recursively enumerable subalgebras of a recursive Boolean algebra," Algebra Logika,25, No. 6, 631–642 (1986).

    Google Scholar 

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 31, No. 1, pp. 38–46, January–February, 1992.

Translated by the author

Rights and permissions

Reprints and permissions

About this article

Cite this article

Odintsov, S.P. Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra. Algebr Logic 31, 24–29 (1992). https://doi.org/10.1007/BF02259855

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation