On a question of Kalimullin

DOI10.1090/proc/13954OpenAlexW2791941292MaRDI QIDQ4563668

Gregory Igusa, Alexander G. Melnikov, Rodney G. Downey

Publication date: 4 June 2018

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/38e89ef49051477a3c548198f14fee3e3af7339a

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (1)

Categorical linearly ordered structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computable categoricity
• Iterated trees of strategies and priority arguments
• Computable structures and the hyperarithmetical hierarchy
• A computability theoretic equivalent to Vaught's conjecture
• Effectively categorical abelian groups
• Degree spectra of intrinsically c.e. relations
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• PRIORITY ARGUMENTS VIA TRUE STAGES
• ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE
• CONSTRUCTIVE ALGEBRAS I

This page was built for publication: On a question of Kalimullin