Recursion Theory in a Lower SemilatticeThe Journal of Symbolic Logic (1992)
In §3 we construct a universal, N0-categorical recursively presented partial order with greatest lower bound operator. This gives us the unique structure which embeds every countable lower semilattice. In §§5 and 6 we investigate the recursive and recursively enumerable substructures of this structure, in particular finding a suitable definition for the simple-maximal hierarchy and giving an example of an infinite recursively enumerable substructure which does not contain any infinite recursive substructure.
Publication DateSeptember, 1992
Citation InformationAlex Feldman. "Recursion Theory in a Lower Semilattice" The Journal of Symbolic Logic Vol. 57 Iss. 3 (1992)
Available at: http://works.bepress.com/alex_feldman/4/