On the complexity of inductive definitions
From MaRDI portal
Publication:3422019
DOI10.1017/S0960129506005585zbMATH Open1117.03050OpenAlexW2063577194MaRDI QIDQ3422019FDOQ3422019
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
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)
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
- Title not available (Why is that?)
- \(\Pi_1^0\)-positive inductive definability on abstract structures
- New Computational Paradigms
- Computational inductive definability
- A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
- A framework for measuring the complexity of mathematical concepts
- The functional dimension of inductive definitions
- Variations on inductive-recursive definitions
- Structuring metatheory on inductive definitions
- Inductive Complexity of Goodstein’s Theorem
- Title not available (Why is that?)
- Comparing inductive and circular definitions: Parameters, complexity and games
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)
