The complexity of inductive definability
From MaRDI portal
Recommendations
Cited in
(14)- Representation theorems for transfinite computability and definability
- Computability theory. Abstracts from the workshop held January 7--13, 2018
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
- _1⁰-positive inductive definability on abstract structures
- The complexity of definability by open first-order formulas
- On the complexity of inductive definitions
- A programming language for the inductive sets, and applications
- Inductive Complexity of Goodstein’s Theorem
- scientific article; zbMATH DE number 922631 (Why is no real title available?)
- The Exact Complexity of the First-Order Logic Definability Problem
- Index sets for finite normal predicate logic programs with function symbols
- Computational inductive definability
- Comparing inductive and circular definitions: Parameters, complexity and games
This page was built for publication: The complexity of inductive definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717025)