Dependence relations in computably rigid computable vector spaces

DOI10.1016/J.APAL.2004.06.007zbMath1076.03029OpenAlexW1973874354MaRDI QIDQ703839

Valentina S. Harizanov, R. D. Dimitrov, Andrey S. Morozov

Publication date: 11 January 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.06.007

zbMATH Keywords

computable automorphism groupscomputable vector spacesdependence algorithm

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Simple structures with complex symmetry ⋮ Turing degrees and automorphism groups of substructure lattices

Cites Work

• Recursion theory on fields and abstract dependence
• Effective dimension
• Recursively enumerable vector spaces
• Controlling the dependence degree of a recursively enumerable vector space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dependence relations in computably rigid computable vector spaces