5 found
Andrey Frolov [3]Andrey N. Frolov [2]
  1.  16
    Categoricity Spectra for Rigid Structures.Ekaterina Fokina, Andrey Frolov & Iskander Kalimullin - 2016 - Notre Dame Journal of Formal Logic 57 (1):45-57.
    For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.
    Direct download (3 more)  
    Export citation  
    Bookmark   6 citations  
  2.  12
    Increasing Η ‐Representable Degrees.Andrey N. Frolov & Maxim V. Zubkov - 2009 - Mathematical Logic Quarterly 55 (6):633-636.
    In this paper we prove that any Δ30 degree has an increasing η -representation. Therefore, there is an increasing η -representable set without a strong η -representation.
    Direct download  
    Export citation  
    Bookmark   3 citations  
  3.  41
    Degree Spectra of the Successor Relation of Computable Linear Orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.
    We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.
    Direct download (4 more)  
    Export citation  
    Bookmark   2 citations  
  4.  5
    Computable Linear Orders and Products.Andrey N. Frolov, Steffen Lempp, Keng Meng Ng & Guohua Wu - 2020 - Journal of Symbolic Logic 85 (2):605-623.
    We characterize the linear order types $\tau $ with the property that given any countable linear order $\mathcal {L}$, $\tau \cdot \mathcal {L}$ is a computable linear order iff $\mathcal {L}$ is a computable linear order, as exactly the finite nonempty order types.
    Direct download (2 more)  
    Export citation  
  5.  1
    The Simplest Low Linear Order with No Computable Copies.Andrey Frolov & Maxim Zubkov - forthcoming - Journal of Symbolic Logic:1-18.
    Direct download (2 more)  
    Export citation