Primitive recursion in the abstract

DOI10.1017/S0960129519000112zbMath1435.68064WikidataQ126318139 ScholiaQ126318139MaRDI QIDQ5220181

Jean-Yves Marion, Daniel Leivant

Publication date: 11 March 2020

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

zbMATH Keywords

primitive recursionimplicit computational complexityfinite structuresprogram terminationstructure 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)

Related Items (1)

Algorithmically broad languages for polynomial time and space

Cites Work

• Primitive recursive selection functions for existential assertions over abstract algebras
• Metafinite model theory
• On non-determinacy in simple computing devices
• A Representation Theorem for Primitive Recursive Algorithms
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Formalized recursive functionals and formalized realizability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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