Skip to main content Accessibility help

Recursion theory in a lower semilattice

  • Alex Feldman (a1)


In §3 we construct a universal, ℵ0-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.

The idea of looking at the lattice of recursively enumerable substructures of some recursive algebraic structure was introduced by Metakides and Nerode in [5], and since then many different kinds of algebraic structures have been studied in this way, including vector spaces, Boolean algebras, groups, algebraically closed fields, and equivalence relations. Since different algebraic structures have different recursion theoretic properties, one natural question is whether an algebraic structure with relatively little structure (such as a partial order or an equivalence relation) exhibits behavior more like classical recursion theory than one with more structure (such as vector spaces or algebraically closed fields).

In [6] and [7], Metakides and Remmel studied recursion theory on orderings, and, as they point out in [6], orderings differ from most other algebraic structures in that the algebraic closure operation on orderings is trivial; but this does not present a problem for them, given the questions they explore. Moreover, they take an approach of proving general theorems which can then be applied to specific orderings. Our tack is different, although also well-established (see, for example, [3]), in which a “largest” structure is defined (in §3) which corresponds to the natural numbers in classical recursion theory. In order to distinguish substructures from subsets, a function symbol is added, namely greatest lower bound. The greatest lower bound function is fundamental to the study of orderings and occurs naturally in many of them, and thus is an appropriate addition to the theory of orderings. In §4 we redefine the concepts of simple and maximal in a manner appropriate to this structure, and prove several existence theorems.



Hide All
1.Carroll, J. S., Some undecidability results for lattices in recursion theory, Pacific Journal of Mathematics, vol. 122 (1986), pp. 319331.
2.Chang, C. C. and Keisler, H. J., Model theory, North-Holland, Amsterdam, 1973.
3.Guichard, D., Automorphisms on substructure lattices in recursive algebra, Annals of Pure and Applied Logic, vol. 25 (1983), pp. 4758.
4.Manasse, M. A., Techniques and counterexamples in almost categorical recursive model theory, Doctoral Thesis, University of Wisconsin, Madison, Wisconsin, 1982.
5.Metakides, G. and Nerode, A., Recursion theory and algebra, Algebra and logic, Lecture Notes in Mathematics, vol. 450, Springer-Verlag, New York, 1975, pp. 209219.
6.Metakides, G. and Remmel, J. B., Recursion theory on orderings, this Journal, vol. 44 (1979), pp. 383402.
7.Remmel, J. B., Recursion theory on orderings. II, this Journal, vol. 45 (1980), pp. 317333.
8.Sacks, G. E., Saturated model theory, Benjamin, Reading, Massachusetts, 1972.


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed