Recursion, induction and well-founded orders

MaRDI QIDQ5403201zbMATH OpenFDO

Authors Carlos Mario Parra-Londoño

Publication date 25 March 2014

zbMATH Keywords

recursioninductionwell-founded order

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Axiomatics of classical set theory and its fragments (03E30)

Recommendations

• scientific article; zbMATH DE number 4099283
• On equivalents of well-foundedness. An experiment in MIZAR
• scientific article; zbMATH DE number 2037780
• scientific article; zbMATH DE number 1163362
• scientific article; zbMATH DE number 860046

Cited in

(10)

• Induction using term orders
• Computer Aided Systems Theory – EUROCAST 2005
• On equivalents of well-foundedness. An experiment in MIZAR
• scientific article; zbMATH DE number 1841839 (Why is no real title available?)
• Elementary descent recursion and proof theory
• Induction-recursion and initial algebras.
• Natural numbers, order and mathematical induction
• Intuitionistically provable recursive well-orderings
• KBOs, ordinals, subrecursive hierarchies and all that
• Proving open properties by induction

This page was built for publication: Recursion, induction and well-founded orders

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