scientific article; zbMATH DE number 3572144
From MaRDI portal
Publication:4143289
zbMath0367.02023MaRDI QIDQ4143289
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99) Other classical first-order model theory (03C68)
Related Items (8)
A robuster Scott rank ⋮ COMPUTABLE POLISH GROUP ACTIONS ⋮ Computable torsion abelian groups ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ The complexity of computable categoricity ⋮ Computability-theoretic categoricity and Scott families ⋮ A.D. Taimanov and model theory in Kazakhstan ⋮ Computable categoricity for algebraic fields with splitting algorithms
This page was built for publication:
