A computably categorical structure whose expansion by a constant has infinite computable dimension

DOI10.2178/jsl/1067620182zbMath1055.03026OpenAlexW2096515662MaRDI QIDQ4650279

Bakhadyr Khoussainov, Denis R. Hirschfeldt, Richard A. Shore

Publication date: 9 February 2005

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1067620182

zbMATH Keywords

computable dimensioncomputably categorical structure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (10)

Degree spectra and computable dimensions in algebraic structures ⋮ Finite computable dimension and degrees of categoricity ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ On the effective universality of mereological theories ⋮ Algebraic structures computable without delay ⋮ Eliminating unbounded search in computable algebra ⋮ A computably stable structure with no Scott family of finitary formulas ⋮ Prime models of finite computable dimension ⋮ Coding in the automorphism group of a computably categorical structure ⋮ 2009 North American Annual Meeting of the Association for Symbolic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Computable single-valued numerations
• Computable isomorphisms, degree spectra of relations, and Scott families
• Degree spectra and computable dimensions in algebraic structures
• Degree spectra of intrinsically c.e. relations
• Recursive categoricity and persistence
• Computably categorical structures and expansions by constants

This page was built for publication: A computably categorical structure whose expansion by a constant has infinite computable dimension