Minimal Predicates for Δ-Definability

We consider two kinds of reducibilities on finite families of predicates on a countable set: the definability of predicates and their complements of one family via another by means of existential formulas with parameters and the same definability on isomorphism types of families. Ordered structures of degrees generated by families of unary predicates are described. It is proved that for both reducibilities, there exist continuum many minimal nonzero degrees.

This is a preview of subscription content, access via your institution.


  1. 1.

    C. Spector, “On degrees of recursive unsolvability,” Ann. Math. (2), 64, No. 3, 581-592 (1956).

    MathSciNet  Article  Google Scholar 

  2. 2.

    G. E. Sacks, “A minimal degree less than 0',” Bull. Am. Math. Soc., 67, 416-419 (1961).

    MathSciNet  Article  Google Scholar 

  3. 3.

    A. S. Morozov, “On some reducibility and existential interpretability of structures,” Sib. Math. J., 58, No. 2, 281-287 (2017).

    MathSciNet  Article  Google Scholar 

  4. 4.

    A. S. Morozov, A. Zh. Satekbaeva, and J. A. Tussupov, “On the existential interpretability of structures,” Sib. El. Mat. Izv., 11, 557-566 (2014);

    MathSciNet  MATH  Google Scholar 

  5. 5.

    Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

Download references

Author information



Corresponding author

Correspondence to A. S. Morozov.

Additional information

D. A. Tussupov is Supported by KN MON RK (project No. AP08855497).

A. S. Morozov is Supported by SB RAS Fundamental Research Program I.1.1 (project No. 0314-2019-0003).

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Morozov, A.S., Tussupov, D.A. Minimal Predicates for Δ-Definability. Algebra Logic 59, 328–340 (2020).

Download citation


  • Δ-definability
  • existential formula
  • ordered structure of degrees
  • minimal degrees