Hostname: page-component-76fb5796d-wq484 Total loading time: 0 Render date: 2024-04-30T00:14:25.952Z Has data issue: false hasContentIssue false
  • English
  • Français

Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets

Published online by Cambridge University Press:  12 March 2014

Manuel Lerman
Manuel Lerman*
Affiliation:
University of Connecticut, Storrs, Connecticut 06268
Get access Rights & Permissions [Opens in a new window]

Extract

Throughout this paper, α will denote an admissible ordinal. Let (α) denote the lattice of α-r.e. sets, i.e., the lattice whose elements are the α-r.e. sets, and whose ordering is given by set inclusion. Call a set A ∈ (α)α*-finite if it is α-finite and has ordertype < α* (the Σ1-projectum of α). The α*-finite sets form an ideal of (α), and factoring (α) by this ideal, we obtain the quotient lattice *(α).

We will fix a language ℒ suitable for lattice theory, and discuss decidability in terms of this language. Two approaches have succeeded in making some progress towards determining the decidability of the elementary theory of (α). Each approach was first used by Lachlan for α = ω. The first approach is to relate the decidability of the elementary theory of (α) to that of a suitable quotient lattice of (α) by a congruence relation definable in ℒ. This technique was used by Lachlan [4, §1] to obtain the equidecidability of the elementary theories of (ω) and *(ω), and was generalized by us [6, Corollary 1.2] to yield the equidecidability of the elementary theories of (α) and *(α) for all α. Lachlan [3] then adopted a different approach.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 41 , Issue 2 , June 1976 , pp. 405 - 418
Copyright
Copyright © Association for Symbolic Logic 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

Research partially supported by NSF grant GP-32463

References

REFERENCES

[1] Chong, C. T. and Lerman, M., Hyperhypersimple α-r.e. sets, Annals of Mathematical Logic (to appear).Google Scholar
[2] Grätzer, G., Lattice theory, first concepts and distributive lattices, W. H. Freeman and Co., New York, 1971, 212 pp.Google Scholar
[3] Lachlan, A. H., The elementary theory of recursively enumerable sets, Duke Mathematical Journal, vol. 35 (1968), pp. 123–146.CrossRefGoogle Scholar
[4] Lachlan, A. H., On the lattice of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37.CrossRefGoogle Scholar
[5] Leggett, A., Maximal α-r.e. sets and their complements, Annals of Mathematical Logic, vol. 6 (1974), pp. 293–357.CrossRefGoogle Scholar
[6] Lerman, M., Ideals of generalized finite sets in lattices of α-recursively enumerable sets (to appear).Google Scholar
[7] Lerman, M., Maximal α-r.e. sets, Transactions of the American Mathematical Society, vol. 188 (1974), pp. 341–386.Google Scholar
[8] Lerman, M., Types of simple α-recursively enumerable sets, this Journal, vol. 41 (1976), pp. 419–426.Google Scholar
[9] Lerman, M. and Simpson, S. G., Maximal sets in α-recursion theory, Israel Journal of Mathematics, vol. 14 (1973), pp. 236–247.CrossRefGoogle Scholar
[10] Machtey, M., Admissible ordinals and lattices of α-r.e. sets, Annals of Mathematical Logic, vol. 2 (1971), pp. 379–417.CrossRefGoogle Scholar
[11] Owings, J. C. Jr., Recursion, metarecursion, and inclusion, this Journal, vol. 32 (1967), pp. 173–179.Google Scholar