Walther recursion

DOI10.1007/3-540-61511-3_119MaRDI QIDQ4647554zbMATH OpenOpenAlexFDO

Authors David Allen McAllester, Kostas Arkoudas

Publication date 15 January 2019

Published in Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61511-3_119

zbMATH Keywords

tree automatonrecursive definitionrecursive callacceptable definitionnatural definition

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Term rewriting theory for the primitive recursive functions
• An ordinal calculus for proving termination in term rewriting
• scientific article; zbMATH DE number 1405455
• Ordinal complexity of recursive definitions
• scientific article; zbMATH DE number 4072437

Cites work

• scientific article; zbMATH DE number 3702108 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• IMPS: An interactive mathematical proof system
• On proving the termination of algorithms by machine
• Orderings for term-rewriting systems

Cited in

(2)

• scientific article; zbMATH DE number 1405455 (Why is no real title available?)
• Inferring program specifications in polynomial-time

Describes a project that uses

Uses Software

• IMPS

This page was built for publication: Walther recursion

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