Switch to: Citations

Add references

You must login to add references.
  1. On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.
    We generalize a well-knownSmullyan's result, by showing that any two sets of the kindC a = {x/ xa} andC b = {x/ xb} are effectively inseparable (if I b). Then we investigate logical and recursive consequences of this fact (see Introduction).
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   595 citations  
  • Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Theorie Der Numerierungen III.Ju L. Erš - 1976 - Mathematical Logic Quarterly 23 (19‐24):289-371.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Theorie Der Numerierungen III.Ju L. Erš - 1977 - Mathematical Logic Quarterly 23 (19-24):289-371.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Theorie der Numerierungen II.J. U. L. Eršov - 1975 - Mathematical Logic Quarterly 21 (1):473-584.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Deduction-preserving ‘Recursive Isomorphisms’ between Theories.Marian Boykan Pour-El & Saul A. Kripke - 1967 - Fundamenta Mathematicae 61:141-163.
    Download  
     
    Export citation  
     
    Bookmark   3 citations