On a question of Kalimullin
From MaRDI portal
Recommendations
Cites work
- A computability theoretic equivalent to Vaught's conjecture
- Analytic equivalence relations satisfying hyperarithmetic-is-recursive
- Computable structures and the hyperarithmetical hierarchy
- CONSTRUCTIVE ALGEBRAS I
- Degree spectra of intrinsically c. e. relations
- Effectively categorical abelian groups
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 3781440 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- Iterated trees of strategies and priority arguments
- PRIORITY ARGUMENTS VIA TRUE STAGES
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- The complexity of computable categoricity
Cited in
(8)- Categorical linearly ordered structures
- Enumerations in computable structure theory
- Intrinsic bounds on complexity and definability at limit levels
- scientific article; zbMATH DE number 5788441 (Why is no real title available?)
- scientific article; zbMATH DE number 3983329 (Why is no real title available?)
- On a question of Mehta and Pauly
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- An arithmetic analysis of closed surfaces
This page was built for publication: On a question of Kalimullin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4563668)