COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY

DOI10.1017/jsl.2014.68zbMath1359.03034OpenAlexW2133986925MaRDI QIDQ5251361

Noam Greenberg, Steffen Lempp, Asher M. Kach, Daniel D. Turetsky

Publication date: 20 May 2015

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d0fbd72d89b077b9e03f7f955a0616190ef5fa51

zbMATH Keywords

computable categorical order typecomputable order typehereditary countable setomega-1-computability

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (3)

UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ Computable categoricity for pseudo-exponential fields of \(\aleph_1\)

Cites Work

• Unnamed Item
• Unnamed Item
• On the recursive functions of ordinal numbers
• Maximal sets in \(\alpha\)-recursion theory
• Uncomplemented C(X)-Subalgebras of C(X)
• Concerning similarity transformations of linearly ordered sets

This page was built for publication: COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY