On a question of Kalimullin

DOI10.1090/PROC/13954OpenAlexW2791941292MaRDI QIDQ4563668FDOQ4563668

Could not fetch data.

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

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

Cites Work

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

Cited In (6)

• An arithmetic analysis of closed surfaces
• Title not available (Why is that?)
• Categorical linearly ordered structures
• Intrinsic bounds on complexity and definability at limit levels
• On a question of Mehta and Pauly
• Title not available (Why is that?)

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)