Switch to: References

Add citations

You must login to add citations.
  1. Logical aspects of Cayley-graphs: the group case.Dietrich Kuske & Markus Lohrey - 2004 - Annals of Pure and Applied Logic 131 (1-3):263-286.
    We prove that a finitely generated group is context-free whenever its Cayley-graph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Schupp, our result gives a logical characterization of context-free groups and also proves a conjecture of Schupp. To derive this result, we investigate general graphs and show that a graph of bounded degree with a high degree of symmetry is context-free whenever its monadic second-order theory is decidable. Further, it is shown that the word (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Second thoughts around some of göde's writings:.G. Kreisel - 1998 - Synthese 114 (1):99-160.
    Download  
     
    Export citation  
     
    Bookmark   4 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  
  • Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.Robert I. Soare - 1982 - Annals of Mathematical Logic 22 (1):69.
    Download  
     
    Export citation  
     
    Bookmark   11 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  
  • On countable locally described structures.Berthold J. Maier - 1987 - Annals of Pure and Applied Logic 35 (C):205-246.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • New Degree Spectra of Abelian Groups.Alexander G. Melnikov - 2017 - Notre Dame Journal of Formal Logic 58 (4):507-525.
    We show that for every computable ordinal of the form β=δ+2n+1>1, where δ is zero or a limit ordinal and n∈ω, there exists a torsion-free abelian group having an X-computable copy if and only if X is nonlowβ.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Friedberg splittings of recursively enumerable sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.
    A splitting A1A2 = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W — A not r.e., W — Ai≠0 for I = 1,2. In an earlier paper, the authors investigated Friedberg splittings of maximal sets and showed that they formed an orbit with very interesting degree-theoretical properties. In the present paper we continue our investigations, this time analyzing Friedberg splittings and in particular their orbits and degrees for various classes (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations