Abstract
We study the algorithmic properties of the semilattices introduced in 1972 by Lachlan in his work on recursively enumerable m-degrees, the so-called Lachlan semilattices. We show that in Lachlan’s definition the effectivity condition on the meet can be omitted in the sequence determining such a semilattice.
Similar content being viewed by others
References
Lachlan A. H., “Recursively enumerable many-one degrees,” Algebra i Logika, 11, No. 3, 326–356 (1972).
Goncharov S. S. and Sorbi A., “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, 36, No. 6, 359–369 (1997).
Podzorov S. Yu., “Local structure of Rogers semilattices of Σ 0n -computable numberings,” Algebra and Logic, 44, No. 2, 82–94 (2005).
Denisov S. D., “The structure of upper semilattices of recursively enumerable m-degrees and related issues. 1,” Algebra i Logika, 17, No. 6, 643–683 (1978).
Ershov Yu. L., Numbering Theory [in Russian], Nauka, Moscow (1977).
Ershov Yu. L., “Necessary isomorphism conditions for Rogers semilattices of finite partially ordered sets,” Algebra and Logic, 42, No. 4, 232–236 (2003).
Rogers H., Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).
Grätzer G., General Lattice Theory [Russian translation], Mir, Moscow (1982).
Author information
Authors and Affiliations
Additional information
Original Russian Text Copyright © 2006 Podzorov S. Yu.
The author was partially supported by the Program “Universities of Russia” (Grant UR.04.01.013), KTsFE (Grant PD02-1.1-475), and the Russian Foundation for Basic Research (Grant 05-01-00819).
__________
Translated from Sibirski \(\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{l} \) Matematicheski \(\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{l} \) Zhurnal, Vol. 47, No. 2, pp. 383–393, March–April, 2006.
Rights and permissions
About this article
Cite this article
Podzorov, S.Y. On the definition of a Lachlan semilattice. Sib Math J 47, 315–323 (2006). https://doi.org/10.1007/s11202-006-0045-2
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11202-006-0045-2