Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-17T15:03:44.764Z Has data issue: false hasContentIssue false
  • English
  • Français

Splitting properties of n-c.e. enumeration degrees

Published online by Cambridge University Press:  12 March 2014

I. SH. Kalimullin
I. SH. Kalimullin*
Affiliation:
Chair of Algebra, Department of Mathematics, Kazan State University, 18 Kremlevskaya STR. 420008 Kazan, Russia, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

It is proved that if 1 < m < 2p ≤ n for some integer p then the elementary theories of posets of m-c.e. and n-c.e. e-degrees are distinct. It is proved also that the structures 〈2n, ≤, 〉 and 〈2n, ≤. P〉 are not elementary equivalent where P is the predicate P(a) = “a is a e-degree”.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 67 , Issue 2 , June 2002 , pp. 537 - 546
Copyright
Copyright © Association for Symbolic Logic 2002

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.)

References

REFERENCES

[1]Ahmad, S., Embedding the diamond in the Σ2 enumeration degrees, this Journal, vol. 50 (1991), pp. 195–212.Google Scholar
[2]Arslanov, M. M., Kalimullin, I. Sh., and Sorbi, A., Density results in the Δ20 e-degrees, Archive for Mathematical Logic, to appear.Google Scholar
[3]Cooper, S. B., Enumeration reducihility, nondeterministic computations and relative computability of partial functions, Recursion theory week, Oberwolfach 1989 (Ambos-Spies, K., Müller, G., and Sacks, G. E., editors), Lecture Notes in Mathematics, vol. 1432, Springer-Verlag, Heidelberg, 1990, pp. 57–110.Google Scholar
[4]Cooper, S. B., Enumeration reducihility, nondeterministic computations and relative computability of partial functions, Recursion theory week, Oberwolfach 1989 (Ambos-Spies, K., Muller, G., and Sacks, G. E., editors), Lecture Notes in Mathematics, vol. 1432, Springer-Verlag, Heildelberg, 1990, pp. 57–110.Google Scholar
[5]Downey, R. G., d. r. e. degrees and the nondiamond theorem, Bulletin of the London Mathematical Society, vol. 21 (1989), pp. 43–50.CrossRefGoogle Scholar
[6]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[7]Kalimullin, I. Sh., On elementary theories of n-c.e. enumeration degrees, Izvestija VUZov, Matematika, to appear (in Russian).Google Scholar
[8]Soare, R. I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg, 1987.CrossRefGoogle Scholar