Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)The number of countable models.Michael Morley - 1970 - Journal of Symbolic Logic 35 (1):14-18.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • (2 other versions)On the Number of Countable Models of a Countable Superstable Theory.Terrence Millar - 1982 - Journal of Symbolic Logic 47 (1):215-217.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • An Application of Games to the Completeness Problem for Formalized Theories.A. Ehrenfeucht - 1967 - Journal of Symbolic Logic 32 (2):281-282.
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • On Martin's conjecture.C. M. Wagner - 1982 - Annals of Mathematical Logic 22 (1):47.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Denumerable Models of Complete Theories.R. L. Vaught, Lars Svenonius, Erwin Engeler & Gebhard Fukrken - 1970 - Journal of Symbolic Logic 35 (2):342-344.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Scott sentences and admissible sets.Mark Nadel - 1974 - Annals of Mathematical Logic 7 (2):267.
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • Theories of Linear Order.Matatyahu Rubin - 1981 - Journal of Symbolic Logic 46 (3):662-663.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6b65f85844-t9k8j uwo