Primitive recursion in the abstract

DOI10.1017/S0960129519000112MaRDI QIDQ5220181zbMATH OpenWikidataFDO

Authors Daniel M. Leivant, Jean-Yves Marion

Publication date 11 March 2020

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

implicit computational complexityfinite structuresprogram terminationprimitive recursionstructure transformationprogram variants

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 1342252
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• scientific article; zbMATH DE number 14698
• scientific article; zbMATH DE number 3960962
• About primitive recursive algorithms

Cites work

• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3711948 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 1956513 (Why is no real title available?)
• scientific article; zbMATH DE number 1860674 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 3291106 (Why is no real title available?)
• scientific article; zbMATH DE number 3066801 (Why is no real title available?)
• A representation theorem for primitive recursive algorithms
• Formalized recursive functionals and formalized realizability
• Metafinite model theory
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On non-determinacy in simple computing devices
• Primitive recursive selection functions for existential assertions over abstract algebras

Cited in

(16)

• scientific article; zbMATH DE number 14698 (Why is no real title available?)
• scientific article; zbMATH DE number 23837 (Why is no real title available?)
• Stratified polymorphism and primitive recursion
• scientific article; zbMATH DE number 4052989 (Why is no real title available?)
• scientific article; zbMATH DE number 445161 (Why is no real title available?)
• scientific article; zbMATH DE number 5033764 (Why is no real title available?)
• Primitive recursion for higher-order abstract syntax
• scientific article; zbMATH DE number 2185713 (Why is no real title available?)
• Algorithmically broad languages for polynomial time and space
• Abstract recursive utility
• A proof-theoretic account of primitive recursion and primitive iteration
• scientific article; zbMATH DE number 3885307 (Why is no real title available?)
• Do we need recursion?
• A difference in complexity between recursion and tail recursion
• scientific article; zbMATH DE number 4115928 (Why is no real title available?)
• scientific article; zbMATH DE number 3960962 (Why is no real title available?)

This page was built for publication: Primitive recursion in the abstract

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