scientific article; zbMATH DE number 5175704
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Properties of classes of models (03C52) Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)
Related Items
There is no classification of the decidably presentable structures, The index set of uncountably categorical theories, Autostability of prime models under strong constructivizations, Scott sentences for certain groups, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Index sets for some classes of structures