Switch to: Citations

Add references

You must login to add references.
  1. Relations Intrinsically Recursive in Linear Orders.Michael Moses - 1986 - Mathematical Logic Quarterly 32 (25‐30):467-472.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Computability theory and linear orders.Rod Downey - 1998 - In IUrii Leonidovich Ershov (ed.), Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.
    Download  
     
    Export citation  
     
    Bookmark   13 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   43 citations  
  • Relations Intrinsically Recursive in Linear Orders.Michael Moses - 1986 - Mathematical Logic Quarterly 32 (25-30):467-472.
    Download  
     
    Export citation  
     
    Bookmark   8 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-c4c498947-z4tjs uwo