Annals of Pure and Applied Logic 132 (1):97-108 (2005)
| Authors |
|
| Abstract |
We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Turing degrees. As a corollary, we answer a question asked by A.S. Morozov in [Rigid constructive modules, Algebra and Logic, 28 570–583 ; 379–387 ]
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1016/j.apal.2004.06.007 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Controlling the Dependence Degree of a Recursive Enumerable Vector Space.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (1):13-22.
Citations of this work BETA
No citations found.
Similar books and articles
Computability of Compact Operators on Computable Banach Spaces with Bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
Model-Theory of Vector-Spaces Over Unspecified Fields.David Pierce - 2009 - Archive for Mathematical Logic 48 (5):421-436.
Division Rings Whose Vector Spaces Are Pseudofinite.Lou van den Dries & Vinicius Cifú Lopes - 2010 - Journal of Symbolic Logic 75 (3):1087 - 1090.
$$\Pi^0_1$$ -Presentations of Algebras.Bakhadyr Khoussainov, Theodore Slaman & Pavel Semukhin - 2006 - Archive for Mathematical Logic 45 (6):769-781.
The Computable Dimension of Trees of Infinite Height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
Quasimaximality and Principal Filters Isomorphism Between.Rumen Dimitrov - 2004 - Archive for Mathematical Logic 43 (3):415-424.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.
A Computably Enumerable Vector Space with the Strong Antibasis Property.L. R. Galminas - 2000 - Archive for Mathematical Logic 39 (8):605-629.
Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces.Iraj Kalantari & Allen Retzlaff - 1977 - Journal of Symbolic Logic 42 (4):481-491.
Computable Categoricity of Trees of Finite Height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
D-Computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
On Degree-Preserving Homeomorphisms Between Trees in Computable Topology.Iraj Kalantari & Larry Welch - 2008 - Archive for Mathematical Logic 46 (7-8):679-693.
The Approximation Structure of a Computably Approximable Real.George Barmpalias - 2003 - Journal of Symbolic Logic 68 (3):885-922.
Analytics
Added to PP index
2014-01-16
Total views
10 ( #843,106 of 2,411,486 )
Recent downloads (6 months)
1 ( #538,999 of 2,411,486 )
2014-01-16
Total views
10 ( #843,106 of 2,411,486 )
Recent downloads (6 months)
1 ( #538,999 of 2,411,486 )
How can I increase my downloads?
Downloads
