scientific article; zbMATH DE number 922631

MaRDI QIDQ4893151zbMATH OpenFDO

Authors Robert F. Stärk

Publication date 1 September 1996

zbMATH Keywords

Peano arithmeticterminationcorrectnessinductive definitionprovably total functionsProlog programsHerbrand universeformal system BIDinductive extension of a logic program

Mathematics Subject Classification ID

Logic programming (68N17) Inductive definability (03D70)

Recommendations

• New Computational Paradigms
• On the complexity of inductive definitions
• Elementary inductive definitions in HA: From strictly positive towards monotone
• Foundation of logic programming based on inductive definition
• scientific article; zbMATH DE number 956484

Cited in

(8)

• On the complexity of inductive definitions
• New Computational Paradigms
• On Definitions in an Infinitary Language
• A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
• Variations on inductive-recursive definitions
• Structuring metatheory on inductive definitions
• scientific article; zbMATH DE number 4116521 (Why is no real title available?)
• scientific article; zbMATH DE number 1342277 (Why is no real title available?)

This page was built for publication:

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