Skip to main content
Log in

Working below a low2 recursively enumerably degree

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Fejer, P.A., Shore, R.A.: Embeddings and extension of embeddings in the r.e. tt- and wtt-degrees. In: Ebbinghaus, H.D. et al. (eds.) Recursion theory week. Berlin: Springer 1985 (Lect. Notes Math., vol. 1141), pp. 121–140)

    Google Scholar 

  • Harrington L., Slaman, T.: An interpretation of arithmetic in the theory of the furing degrees of the recursively enumerable sets. (1990, in preparation)

  • Lachlan, A.H.: Decomposition of recursively enumerable degrees. Proc. Am. Math. Soc.79, 629–634 (1980)

    Google Scholar 

  • Ladner, R.E., Sasso, L.P.: The weak truth table degrees of recursively enumerable sets. Ann. Math. Logic8, 429–448 (1975)

    Google Scholar 

  • Lerman, M.: Degrees of unsolvability. Berlin: Springer, 1983

    Google Scholar 

  • Robinson, R.W.: Interpolation and embedding in the recursively enumerable degrees. Ann. Math. II. Ser.93, 586–596 (1971)

    Google Scholar 

  • Shore, R.A.: On the ∀∃-sentences of α-recursion theory. In: Fenstad, J.E., Gandy, R.O., Sacks, G.E. (eds.) Generalized recursion theory II. Amsterdam: North-Holland, pp. 331–354, 1978

    Google Scholar 

  • Shore, R.A.: Defining jump classes in the degrees below 0. Proc. Am. Math. Soc.104, 287–292 (1988)

    Google Scholar 

  • Shore, R.A., Slaman, T.: Working below a high recursively enumerable degree (1990)

  • Shore, R.A., Slaman, T.: Splitting and density cannot be combined below any high r.e. degree (1991)

  • Soare, R.I.: Recursively enumerable sets and degrees. Berlin: Springer, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research partially supported by NSF Grants DMS-861018 and DMS-8902797

Research partially supported by NSF Grant DMS-8601856 and PYI Award DMS-8451748

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shore, R.A., Slaman, T.A. Working below a low2 recursively enumerably degree. Arch Math Logic 29, 201–211 (1990). https://doi.org/10.1007/BF01621095

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01621095

Keywords

Navigation