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.
    Download  
     
    Export citation  
     
    Bookmark   592 citations  
  • Recursively enumerable Boolean algebras.J. B. Remmel - 1978 - Annals of Mathematical Logic 15 (1):75.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.
    Download  
     
    Export citation  
     
    Bookmark   47 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-5ff6c685cb-ldh8k uwo