Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download  
     
    Export citation  
     
    Bookmark   594 citations  
  • Unsolvable problems for equational theories.Peter Perkins - 1967 - Notre Dame Journal of Formal Logic 8 (3):175-185.
  • Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
  • Cylindric Algebras. Part I.Leon Henkin, J. Donald Monk, Alfred Tarski, L. Henkin, J. D. Monk & A. Tarski - 1985 - Journal of Symbolic Logic 50 (1):234-237.
  • Non-recursiveness of the set of finite sets of equations whose theories are one-based.Douglas D. Smith - 1972 - Notre Dame Journal of Formal Logic 13 (1):135-138.
  • George Grätzer. Universal algebra. D. Van Nostrand Company, Inc., Princeton etc. 1968, xvi + 368 pp. [REVIEW]Kirby A. Baker - 1973 - Journal of Symbolic Logic 38 (4):643-644.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   43 citations