Switch to: References

Add citations

You must login to add citations.
  1. Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory.Robert E. Byerly - 1984 - Mathematical Logic Quarterly 30 (32-34):499-503.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.
    Download  
     
    Export citation  
     
    Bookmark   1 citation