The formal language of recursion

DOI10.2307/2274814MaRDI QIDQ3480027zbMATH OpenOpenAlexFDO

Authors Yiannis N. Moschovakis

Publication date 1989

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274814

zbMATH Keywords

reductionsabstract algorithmformal language of recursion FLRfoundations of computation theoryKleene recursive functionals

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 3910
• scientific article; zbMATH DE number 3885301
• scientific article; zbMATH DE number 1163990
• The logic of recursive equations
• scientific article; zbMATH DE number 3966062

Cited in

(14)

• Computation on abstract data types. The extensional approach, with an application to streams
• A model of concurrency with fair merge and full recursion
• Towards a geometry of recursion
• Logic operators and quantifiers in type-theory of algorithms
• Axiomatization and characterization of BSP algorithms
• scientific article; zbMATH DE number 3885301 (Why is no real title available?)
• Feferman on computability
• Theses for computation and recursion on concrete and abstract structures
• scientific article; zbMATH DE number 2079037 (Why is no real title available?)
• Recursion and corecursion have the same equational logic
• The unfolding of non-finitist arithmetic
• Intensional aspects of function definitions
• Computable concurrent processes
• A new approach to abstract data types, I Informal development

This page was built for publication: The formal language of recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480027)