scientific article; zbMATH DE number 922631

zbMATH Open0854.03044MaRDI QIDQ4893151FDOQ4893151

Authors: Robert F. Stärk 

Publication date: 1 September 1996

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of inductive definitions

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)