On the complexity of inductive definitions

DOI10.1017/S0960129506005585zbMATH Open1117.03050OpenAlexW2063577194MaRDI QIDQ3422019FDOQ3422019

Jeffrey Remmel, Douglas Cenzer

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)

Cited In (9)

• First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
• Title not available (Why is that?)
• Computational inductive definability
• A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
• The functional dimension of inductive definitions
• Variations on inductive-recursive definitions
• Structuring metatheory on inductive definitions
• Inductive Complexity of Goodstein’s Theorem
• Comparing inductive and circular definitions: Parameters, complexity and games

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the complexity of inductive inference 👍 👎
• Non-Deterministic Inductive Definitions and Fullness 👍 👎
• New Computational Paradigms 👍 👎
• Computational inductive definability 👍 👎
• Inductive definitions over finite structures 👍 👎
• On systems of definitions, induction and recursion 👍 👎
• Inductive Complexity of Goodstein’s Theorem 👍 👎
• On the complexity of induction of structural descriptions 👍 👎

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)