Classes of structures with universe a subset of 1

DOI10.1093/logcom/ext042zbMath1327.03027OpenAlexW2143058347MaRDI QIDQ5406116

Ekaterina B. Fokina, Julia F. Knight, Sy-David Friedman, Russell G. Miller

Publication date: 1 April 2014

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/ext042

zbMATH Keywords

computable categoricity\(\omega _{1}\)-computabilitycomplete equivalence relationcomputable uncountable structureTuring computable embeddings

Mathematics Subject Classification ID

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

Related Items (4)

Finding bases of uncountable free abelian groups is usually difficult ⋮ On the complexity of classes of uncountable structures: trees on $\aleph _1$ ⋮ On ‐complete equivalence relations on the generalized Baire space ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES

This page was built for publication: Classes of structures with universe a subset of  1