The isomorphism problem for classes of computable fields

zbMath1059.03039arXivmath/0212190MaRDI QIDQ701725

Wesley Calvert

Publication date: 16 December 2004

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0212190

zbMATH Keywords

isomorphism problemcomputable modelcomputable fieldindex set of a class of models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (14)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ Computable valued fields ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Degrees of categoricity of trees and the isomorphism problem ⋮ A note on decidable categoricity and index sets ⋮ Scott sentences for certain groups ⋮ Equivalence Relations on Classes of Computable Structures ⋮ The computable embedding problem ⋮ Computable transformations of structures ⋮ Ranked structures and arithmetic transfinite recursion ⋮ The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes ⋮ Complexity of the isomorphism problem for computable free projective planes of finite rank ⋮ Index sets for some classes of structures

This page was built for publication: The isomorphism problem for classes of computable fields