Well-founded Relations in Type Theory

DOI10.1093/JIGPAL/5.6.811MaRDI QIDQ4372855zbMATH OpenOpenAlexFDO

Authors Patricia Peratto

Publication date 13 August 1998

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/5.6.811

zbMATH Keywords

ALF systemprogram constructiontype theorywell-founded inductionwell-founded recursionwell-founded relations

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 1670732
• Computer Aided Systems Theory – EUROCAST 2005
• Inductive families

Cited in

(7)

• On bounded type-definable equivalence relations
• scientific article; zbMATH DE number 1614686 (Why is no real title available?)
• scientific article; zbMATH DE number 1670732 (Why is no real title available?)
• Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations
• Lexicographic Path Induction
• scientific article; zbMATH DE number 1841839 (Why is no real title available?)
• From hierarchies to well-foundedness

This page was built for publication: Well-founded Relations in Type Theory

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