Switch to: References

Add citations

You must login to add citations.
  1. The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
    One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. Unlike the commonly used degrees of structures, the structure degree measure is total. We introduce and study the jump operation for structure degrees. We prove that it has all natural jump properties (including jump inversion theorem, theorem of Ash), which show that our definition is relevant. We study the relation between the structure degree jump (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The automorphism group of the enumeration degrees.Mariya I. Soskova - 2016 - Annals of Pure and Applied Logic 167 (10):982-999.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)A structural dichotomy in the enumeration degrees.Hristo A. Ganchev, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2022 - Journal of Symbolic Logic 87 (2):527-544.
    We give several new characterizations of the continuous enumeration degrees. The main one proves that an enumeration degree is continuous if and only if it is not half of a nontrivial relativized $\mathcal {K}$ -pair. This leads to a structural dichotomy in the enumeration degrees.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
    The jump operator on the ω-enumeration degrees was introduced in [I.N. Soskov, The ω-enumeration degrees, J. Logic Computat. 17 1193–1214]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structure of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of and of the enumeration degrees are isomorphic. In the second part of the paper we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
    We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)A structural dichotomy in the enumeration degrees.Hristo A. Ganchev, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2020 - Journal of Symbolic Logic:1-18.
    We give several new characterizations of the continuous enumeration degrees. The main one proves that an enumeration degree is continuous if and only if it is not half a nontrivial relativized K-pair. This leads to a structural dichotomy in the enumeration degrees.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Regular enumerations.I. N. Soskov & V. Baleva - 2002 - Journal of Symbolic Logic 67 (4):1323-1343.
    In the paper we introduce and study regular enumerations for arbitrary recursive ordinals. Several applications of the technique are presented.
    Download  
     
    Export citation  
     
    Bookmark   1 citation