Pages that link to "Item:Q3422019"
From MaRDI portal
The following pages link to On the complexity of inductive definitions (Q3422019):
Displaying 10 items.
- Computational inductive definability (Q598276) (← links)
- Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
- A framework for measuring the complexity of mathematical concepts (Q920074) (← links)
- The functional dimension of inductive definitions (Q1193414) (← links)
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo (Q2758045) (← links)
- Structuring metatheory on inductive definitions (Q4647512) (← links)
- Inductive Complexity of Goodstein’s Theorem (Q4648198) (← links)
- Variations on inductive-recursive definitions (Q5111280) (← links)
- New Computational Paradigms (Q5717025) (← links)
- A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS (Q5850984) (← links)