Primitive recursion in the abstract

DOI10.1017/S0960129519000112zbMATH Open1435.68064WikidataQ126318139 ScholiaQ126318139MaRDI QIDQ5220181FDOQ5220181

Authors: Daniel M. Leivant, Jean-Yves Marion 

Publication date: 11 March 2020

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

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

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)

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• On non-determinacy in simple computing devices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Metafinite model theory
• Formalized recursive functionals and formalized realizability
• A representation theorem for primitive recursive algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Primitive recursive selection functions for existential assertions over abstract algebras
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Stratified polymorphism and primitive recursion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Primitive recursion for higher-order abstract syntax
• Title not available (Why is that?)
• Algorithmically broad languages for polynomial time and space
• A proof-theoretic account of primitive recursion and primitive iteration
• Abstract recursive utility
• Title not available (Why is that?)
• Do we need recursion?
• Title not available (Why is that?)
• A difference in complexity between recursion and tail recursion
• Title not available (Why is that?)

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)