Switch to: Citations

Add references

You must login to add references.
  1. Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   482 citations  
  • Fifty years of self-reference in arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (4):357-374.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Extremely undecidable sentences.George Boolos - 1982 - Journal of Symbolic Logic 47 (1):191-196.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • An effective fixed-point theorem in intuitionistic diagonalizable algebras.Giovanni Sambin - 1976 - Studia Logica 35 (4):345 - 361.
    Within the technical frame supplied by the algebraic variety of diagonalizable algebras, defined by R. Magari in [2], we prove the following: Let T be any first-order theory with a predicate Pr satisfying the canonical derivability conditions, including Löb's property. Then any formula in T built up from the propositional variables $q,p_{1},...,p_{n}$ , using logical connectives and the predicate Pr, has the same "fixed-points" relative to q (that is, formulas $\psi (p_{1},...,p_{n})$ for which for all $p_{1},...,p_{n}\vdash _{T}\phi (\psi (p_{1},...,p_{n}),p_{1},...,p_{n})\leftrightarrow \psi (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   592 citations