The computable dimension of trees of infinite height
From MaRDI portal
Publication:3370758
Recommendations
Cites work
Cited in
(21)- scientific article; zbMATH DE number 4213466 (Why is no real title available?)
- Computability in uncountable binary trees
- On a question of Slaman and Groszek
- Computability-theoretic categoricity and Scott families
- Computable isomorphisms for certain classes of infinite graphs
- Categoricity spectra of computable structures
- Computable trees of Scott rank ω1CK, and computable approximation
- Computable Heyting algebras with distinguished atoms and coatoms
- Categoricity properties for computable algebraic fields
- Self-embeddings of computable trees
- The tree of tuples of a structure
- \(d\)-computable categoricity for algebraic fields
- Effective categoricity of abelian p-groups
- Growth and irreducibility in path-incompressible trees
- scientific article; zbMATH DE number 3858432 (Why is no real title available?)
- On degree-preserving homeomorphisms between trees in computable topology
- 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
- Computable categoricity for algebraic fields with splitting algorithms
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)