Switch to: Citations

Add references

You must login to add references.
  1. Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
    Download  
     
    Export citation  
     
    Bookmark   66 citations  
  • Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Graph colorings and recursively bounded Π10-classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32:185-194.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Degree spectra of intrinsically C.e. Relations.Denis Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
    We show that for every c.e. degree a > 0 there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is {0, a}. This result can be extended in two directions. First we show that for every uniformly c.e. collection of sets S there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is the set of degrees of elements of S. Then we show that if α ∈ (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.
    The theorem of the title is proven, solving an old question of Remmel. The method of proof uses an algebraic technique of Remmel-Vaught combined with a complex tree of strategies argument where the true path is needed to figure out the final isomorphism.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
    It is known that the spaces of orders on orderable computable fields can represent all Π10 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π10 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computable presentation admits a computable set of representatives for its Archimedean classes.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Decidability and Computability of Certain Torsion-Free Abelian Groups.Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov & Daniel Turetsky - 2010 - Notre Dame Journal of Formal Logic 51 (1):85-96.
    We study completely decomposable torsion-free abelian groups of the form $\mathcal{G}_S := \oplus_{n \in S} \mathbb{Q}_{p_n}$ for sets $S \subseteq \omega$. We show that $\mathcal{G}_S$has a decidable copy if and only if S is $\Sigma^0_2$and has a computable copy if and only if S is $\Sigma^0_3$.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Spaces of orders and their Turing degree spectra.Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, Valentina S. Harizanov & Amir A. Togha - 2010 - Annals of Pure and Applied Logic 161 (9):1134-1143.
    We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their Turing degree spectra contain certain upper cones of degrees. Our approach unifies and extends Sikora’s [28] (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation