scientific article
From MaRDI portal
Publication:4005059
zbMath0754.03026MaRDI QIDQ4005059
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (5)
Existence and uniqueness of structures computable in polynomial time ⋮ Structures computable in polynomial time. II ⋮ Structures computable in polynomial time. I ⋮ Categoricity for primitive recursive and polynomial Boolean algebras ⋮ Primitively recursively categorical linear orderings
This page was built for publication: