Switch to: Citations

Add references

You must login to add references.
  1. Trial and error mathematics I: Dialectical and quasidialectical systems.Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi & Andrea Sorbi - 2016 - Review of Symbolic Logic 9 (2):299-324.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   596 citations  
  • Π10 classes and Boolean combinations of recursively enumerable sets.Carl G. Jockusch - 1974 - Journal of Symbolic Logic 39 (1):95-96.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)S. Barry Cooper, Computability Theory: Chapman & Hall/crc, 2003, US$ 76.95, 424 pp., ISBN-10: 1584882379, ISBN-13: 978-1584882374, hardcover. Dimensions (in inches): 9.7 × 6.2 × 1.1. [REVIEW]Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
    Download  
     
    Export citation  
     
    Bookmark   12 citations