Recursion, induction and well-founded orders

zbMATH Open1294.03035MaRDI QIDQ5403201FDOQ5403201

Authors: Carlos Mario Parra-Londoño 

Publication date: 25 March 2014

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

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)

Cited In (10)

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

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)