Switch to: Citations

Add references

You must login to add references.
  1. The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, methodology and philosophy of science. Amsterdam,: North-Holland Pub. Co.. pp. 24-30.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces.Iraj Kalantari & Allen Retzlaff - 1977 - Journal of Symbolic Logic 42 (4):481-491.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • On R.e. And CO-R.E. Vector spaces with nonextendible bases.J. Remmel - 1980 - Journal of Symbolic Logic 45 (1):20-34.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Review: Uwe Schoning, Complexity and Structure. [REVIEW]Stephen R. Mahaney - 1989 - Journal of Symbolic Logic 54 (3):1106-1107.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Two notes on vector spaces with recursive operations.J. C. E. Dekker - 1971 - Notre Dame Journal of Formal Logic 12 (3):329-334.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.
    Download  
     
    Export citation  
     
    Bookmark   60 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   22 citations  
  • Recursion Theory and Algebra.G. Metakides, A. Nerode, J. N. Crossley, Iraj Kalantari & Allen Retzlaff - 1986 - Journal of Symbolic Logic 51 (1):229-232.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Recursively enumerable Boolean algebras.J. B. Remmel - 1978 - Annals of Mathematical Logic 15 (1):75.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Recursion theory on algebraic structures with independent sets.J. B. Remmel - 1980 - Annals of Mathematical Logic 18 (2):153.
    Download  
     
    Export citation  
     
    Bookmark   11 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-5cf77db6b5-5dtdx uwo