Switch to: References

Add citations

You must login to add citations.
  1. Computability-theoretic categoricity and Scott families.Ekaterina Fokina, Valentina Harizanov & Daniel Turetsky - 2019 - Annals of Pure and Applied Logic 170 (6):699-717.
    Download  
     
    Export citation  
     
    Bookmark  
  • Turing computable embeddings and coding families of sets.Víctor A. Ocasio-González - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 539--548.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
    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-6686886f5-xdvnm uwo