Skip to main content
SpringerLink
Log in

Almost Combinatorial Selector Sets

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

Classes of subsets of positive integers based on the notion of selector functions similar to the Jockusch selector of a semirecursive set are studied.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. N. Degtev, “Recursively-combinatorial properties of subsets of natural numbers,” Algebra i Logika [Algebra and Logic], 29, No. 3, 303-314 (1990).

    Google Scholar 

  2. A. N. Degtev, “Almost semirecursive sets,” Mat. Zametki [Math. Notes], 66, No. 2, 188-193 (1999).

    Google Scholar 

  3. C. G. Jockusch, “Semirecursive sets and positive reducibility,” Trans. Amer. Math. Soc., 131, 420-436 (1968).

    Google Scholar 

  4. S. V. Yablonskii, G. P. Gavrilov, and V. G. Kudryavtsev, Functions of the Algebra of Logic and Post Classes [in Russian], Nauka, Moscow (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tyumen State University, Russia

    A. N. Degtev

Authors
  1. A. N. Degtev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degtev, A.N. Almost Combinatorial Selector Sets. Mathematical Notes 68, 721–723 (2000). https://doi.org/10.1023/A:1026652431306

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026652431306

Search

Navigation