On the definition of a Lachlan semilattice |
| |
| Authors: | S Yu Podzorov |
| |
| Institution: | (1) Sobolev Institute of Mathematics, Novosibirsk, Russia |
| |
| 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 |
| 本文献已被 SpringerLink 等数据库收录！ |
