Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   599 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • On the algebraization of a Feferman's predicate.Franco Montagna - 1978 - Studia Logica 37 (3):221 - 236.
    This paper is devoted to the algebraization of an arithmetical predicate introduced by S. Feferman. To this purpose we investigate the equational class of Boolean algebras enriched with an operation (g=rtail), which translates such predicate, and an operation τ, which translates the usual predicate Theor. We deduce from the identities of this equational class some properties of (g=rtail) and some ties between (g=rtail) and τ; among these properties, let us point out a fixed-point theorem for a sufficiently large class of (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
    Download  
     
    Export citation  
     
    Bookmark   5 citations