|
Sibirskii Matematicheskii Zhurnal, 2006, Volume 47, Number 2, Pages 383–393
(Mi smj864)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On the definition of a Lachlan semilattice
S. Yu. Podzorov Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
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.
Keywords:
distributive semilattice, $m$-degree, arithmetic hierarchy, computable enumeration.
Received: 26.04.2004
Citation:
S. Yu. Podzorov, “On the definition of a Lachlan semilattice”, Sibirsk. Mat. Zh., 47:2 (2006), 383–393; Siberian Math. J., 47:2 (2006), 315–323
Linking options:
https://www.mathnet.ru/eng/smj864 https://www.mathnet.ru/eng/smj/v47/i2/p383
|
Statistics & downloads: |
Abstract page: | 223 | Full-text PDF : | 83 | References: | 44 |
|