scientific article
From MaRDI portal
Publication:3464657
zbMath1369.03116MaRDI QIDQ3464657
Noam Greenberg, Julia F. Knight
Publication date: 27 January 2016
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (6)
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Computable categoricity for pseudo-exponential fields of \(\aleph_1\)
This page was built for publication:
