Abstract recursion as a foundation for the theory of algorithms

This publication has 25 references indexed in Scilit:

• A logical approach to the problem “P=NP?”
  Published by Springer Nature ,2005
• Structure and complexity of relational queries
  Journal of Computer and System Sciences, 1982
• Domains for denotational semantics
  Published by Springer Nature ,1982
• A programming language for the inductive sets, and applications
  Published by Springer Nature ,1982
• The theory of recursive functions, approaching its centennial
  Bulletin of the American Mathematical Society, 1981
• Three Aspects of Recursive Enumerability in Higher Types
  Published by Cambridge University Press (CUP) ,1980
• Global inductive definability
  The Journal of Symbolic Logic, 1978
• The next admissible set
  The Journal of Symbolic Logic, 1971
• Metarecursive sets
  The Journal of Symbolic Logic, 1965
• Recursive functions of symbolic expressions and their computation by machine, Part I
  Communications of the ACM, 1960