Dependence relations in computably rigid computable vector spaces

DOI10.1016/J.APAL.2004.06.007MaRDI QIDQ703839zbMATH OpenOpenAlexFDO

Authors Valentina Harizanov, R. D. Dimitrov, Andrei 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)

Review text

A computable vector space \(V\) is said to be computably rigid if all its computable automorphisms map every one-dimensional subspace of \(V\) into itself. A dependence algorithm for a vector space takes as input a finite set of vectors and decides whether they are linearly dependent or not. The paper constructs a computably rigid computable vector space for which the dependency algorithm has an arbitrary high c.e. Turing degree.

Recommendations

• Degrees of convex dependence in recursively enumerable vector spaces
• The Lattice of Computably Enumerable Vector Spaces
• scientific article; zbMATH DE number 4217338
• Subspaces of computable vector spaces
• Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra

Cites work

• Controlling the dependence degree of a recursively enumerable vector space
• Effective dimension
• scientific article; zbMATH DE number 3878912 (Why is no real title available?)
• scientific article; zbMATH DE number 4217338 (Why is no real title available?)
• scientific article; zbMATH DE number 4150125 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3250559 (Why is no real title available?)
• Recursion theory on fields and abstract dependence
• Recursively enumerable vector spaces

Cited in

(5)

• Degrees of convex dependence in recursively enumerable vector spaces
• Simple structures with complex symmetry
• Turing degrees and automorphism groups of substructure lattices
• The Lattice of Computably Enumerable Vector Spaces
• Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703839)