COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
From MaRDI portal
Publication:5251361
DOI10.1017/jsl.2014.68zbMath1359.03034MaRDI 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
computable categorical order type; computable order type; hereditary countable set; omega-1-computability
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
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