The computable dimension of trees of infinite height
From MaRDI portal
Publication:3370758
DOI10.2178/JSL/1107298513zbMATH Open1098.03049OpenAlexW2084666877MaRDI QIDQ3370758FDOQ3370758
Author name not available (Why is that?)
Publication date: 8 February 2006
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1107298513
Recommendations
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
Cited In (16)
- On a question of Slaman and Groszek
- Computability-theoretic categoricity and Scott families
- Computable isomorphisms for certain classes of infinite graphs
- Computable Heyting algebras with distinguished atoms and coatoms
- Computable trees of Scott rank ω1CK, and computable approximation
- Categoricity spectra of computable structures
- Categoricity properties for computable algebraic fields
- Effective categoricity of abelian \(p\)-groups
- Title not available (Why is that?)
- The Computable Dimension of I-Trees of Infinite Height
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Computable categoricity of trees of finite height
- Effective categoricity of equivalence structures
- d-computable categoricity for algebraic fields
- Computable categoricity for algebraic fields with splitting algorithms
- Title not available (Why is that?)
This page was built for publication: The computable dimension of trees of infinite height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370758)