On the complexity of inductive definitions

DOI10.1017/S0960129506005585MaRDI QIDQ3422019zbMATHOpenAlexFDO

Authors Douglas Cenzer, Jeffrey Remmel

Publication date 9 February 2007

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129506005585

Mathematics Subject Classification ID

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

Recommendations

• New Computational Paradigms
• Computational inductive definability
• Non-deterministic inductive definitions and fullness
• scientific article; zbMATH DE number 3935022
• On the complexity of inductive inference
• scientific article; zbMATH DE number 922631
• On the complexity of induction of structural descriptions
• Inductive definitions over finite structures
• Inductive Complexity of Goodstein’s Theorem
• On systems of definitions, induction and recursion

Cited in

(13)

• A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
• Structuring metatheory on inductive definitions
• A framework for measuring the complexity of mathematical concepts
• Inductive Complexity of Goodstein’s Theorem
• The functional dimension of inductive definitions
• Comparing inductive and circular definitions: Parameters, complexity and games
• scientific article; zbMATH DE number 922631 (Why is no real title available?)
• New Computational Paradigms
• scientific article; zbMATH DE number 4116521 (Why is no real title available?)
• Variations on inductive-recursive definitions
• \(\Pi_1^0\)-positive inductive definability on abstract structures
• First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
• Computational inductive definability

This page was built for publication: On the complexity of inductive definitions

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