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  
  • Parametrization over inductive relations of a bounded number of variables.Gregory L. McColm - 1990 - Annals of Pure and Applied Logic 48 (2):103-134.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On Moschovakis closure ordinals.Jon Barwise - 1977 - Journal of Symbolic Logic 42 (2):292-296.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Upper and Lower Bounds for First Order Expressibility.Neil Immerman - 1989 - Journal of Symbolic Logic 54 (1):287-288.
    Download  
     
    Export citation  
     
    Bookmark   9 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-5bb9b4696b-nbvp7 uwo