Dependence relations in computably rigid computable vector spaces

, &
Annals of Pure and Applied Logic 132 (1):97-108 (2005)
  Copy   BIBTEX

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 ]

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2004.06.007

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

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
2014-01-16

Downloads
16 (#851,323)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Valentina Harizanov
George Washington University
Rumen Dimitrov
Sofia University

Citations of this work

No citations found.

Add more citations

References found in this work

Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.

Add more references