zbMATH — the first resource for mathematics

Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra. (English. Russian original) Zbl 0781.03032
Algebra Logic 31, No. 1, 24-29 (1992); translation from Algebra Logika 31, No. 1, 38-46 (1992).
We present a complete description of intrinsically recursively enumerable subalgebras admitting a recursive representation for an arbitrary recursive Boolean algebra.

03D45 Theory of numerations, effectively presented structures
Full Text: DOI EuDML
[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.
[2] E. Barker, ”Intrinsically {\(\Sigma\)} 2 0 -relations,” Preprint, Monash University, Clayton (1987).
[3] Yu. G. Ventsov, ”Non-uniform autostability of models,” Algebra Logika,26, No. 6, 684–714 (1987). · Zbl 0659.03011
[4] E. Barker, ”Intrinsically {\(\Sigma\)} 0 -relations,” Preprint, Monash University, Clayton (1988). · Zbl 0651.03034
[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). · Zbl 0678.03012
[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).
[7] S. P. Odintsov, ”On the lattice of recursively enumerable subalgebras of a recursive Boolean algebra,” Algebra Logika,25, No. 6, 631–642 (1986). · Zbl 0636.03041
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.