Publication:5295696
From MaRDI portal
zbMath1123.03035arXivmath/0610776MaRDI QIDQ5295696
Theodore A. Slaman, Steffen Lempp
Publication date: 30 July 2007
Full work available at URL: https://arxiv.org/abs/math/0610776
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03C52: Properties of classes of models
03C57: Computable structure theory, computable model theory
03C35: Categoricity and completeness of theories
Related Items
There is no classification of the decidably presentable structures, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, The index set of uncountably categorical theories, Autostability of prime models under strong constructivizations, Index sets for some classes of structures, Scott sentences for certain groups