Switch to: Citations

Add references

You must login to add references.
  1. 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   43 citations  
  • Turing machines and the spectra of first-order formulas.Neil D. Jones & Alan L. Selman - 1974 - Journal of Symbolic Logic 39 (1):139-150.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Local definability theory.G. E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Reducibility Among Combinatorial Problems.Richard M. Karp, Raymond E. Miller & James W. Thatcher - 1975 - Journal of Symbolic Logic 40 (4):618-619.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Local definability theory.Gonzalo E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95-137.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Probabilities on finite models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.
    Download  
     
    Export citation  
     
    Bookmark   27 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-68866f4b87-zhzfn uwo