Switch to: References

Add citations

You must login to add citations.
  1. Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
    We consider the computably enumerable sets under the relation of Q-reducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, Q, under this reducibility with the more familiar structure of the c.e. Turing degrees. In our final section, we use coding methods to show that the elementary theory of RQ, Q is undecidable.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Model theory for universal classes with the amalgamation property: A study in the foundations of model theory and algebra.William K. Forrest - 1977 - Annals of Mathematical Logic 11 (3):263.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Higman's Embedding Theorem in a General Setting and Its Application to Existentially Closed Algebras.Oleg V. Belegradek - 1996 - Notre Dame Journal of Formal Logic 37 (4):613-624.
    For a quasi variety of algebras K, the Higman Theorem is said to be true if every recursively presented K-algebra is embeddable into a finitely presented K-algebra; the Generalized Higman Theorem is said to be true if any K-algebra which is recursively presented over its finitely generated subalgebra is embeddable into a K-algebra which is finitely presented over this subalgebra. We suggest certain general conditions on K under which the Higman Theorem implies the Generalized Higman Theorem; a finitely generated K-algebra (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Satisfaction of existential theories in finitely presented groups and some embedding theorems.Abderezak Ould Houcine - 2006 - Annals of Pure and Applied Logic 142 (1):351-365.
    The main result is that for every recursively enumerable existential consistent theory Γ , there exists a finitely presented SQ-universal group H such that Γ is satisfied in every nontrivial quotient of H. Furthermore if Γ is satisfied in some group with a soluble word problem, then H can be taken with a soluble word problem. We characterize the finitely generated groups with soluble word problem as the finitely generated groups G for which there exists a finitely presented group H (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Algebraically prime models.J. T. Baldwin - 1981 - Annals of Mathematical Logic 20 (3):289.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On A Lattice of Relational Reducts.Klaus Kaiser - 1980 - Mathematical Logic Quarterly 26 (25-27):429-432.
    Download  
     
    Export citation  
     
    Bookmark