Computability-Theoretic Complexity of Countable Structures

DOI10.2307/797952zbMath1039.03027OpenAlexW4254084566MaRDI QIDQ4432545

Valentina S. Harizanov

Publication date: 27 October 2003

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0804-toc.htm

zbMATH Keywords

surveycomputable model theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (5)

Turing degrees of nonabelian groups ⋮ Nonmaximal decidable structures ⋮ Weakly maximal decidable structures ⋮ Spaces of orders and their Turing degree spectra ⋮ Degrees of isomorphism types and countably categorical groups

This page was built for publication: Computability-Theoretic Complexity of Countable Structures