On systems of definitions, induction and recursion

DOI10.1007/BF01995107zbMATH Open0786.03028OpenAlexW2041590892MaRDI QIDQ688731FDOQ688731

Authors: Lars Hallnäs 

Publication date: 5 May 1994

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01995107

Recommendations

• Inductive families
• Logical Approaches to Computational Barriers
• Partial inductive definitions as type-systems for \(\lambda\)-terms
• scientific article; zbMATH DE number 512790
• scientific article; zbMATH DE number 65538

zbMATH Keywords

natural deductionCurry-Howard isomorphismsequent calculusprimitive recursion

Mathematics Subject Classification ID

Inductive definability (03D70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Partial inductive definitions as type-systems for \(\lambda\)-terms
• Title not available (Why is that?)
• Variations on inductive-recursive definitions
• Title not available (Why is that?)
• On the complexity of inductive definitions

This page was built for publication: On systems of definitions, induction and recursion

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