Skip to main content
Log in

A computably enumerable vector space with the strong antibasis property

Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

Downey and Remmel have completely characterized the degrees of c.e. bases for c.e. vector spaces (and c.e. fields) in terms of weak truth table degrees. In this paper we obtain a structural result concerning the interaction between the c.e. Turing degrees and the c.e. weak truth table degrees, which by Downey and Remmel's classification, establishes the existence of c.e. vector spaces (and fields) with the strong antibasis property (a question which they raised). Namely, we construct c.e. sets \(B<_{\rm T}A\) such that the c.e. W-degrees below that of A are disjoint from the nonzero c.e. T-degrees below that of A and comparable to that of B.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Additional information

Received: 2 December 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galminas, L. A computably enumerable vector space with the strong antibasis property. Arch Math Logic 39, 605–629 (2000). https://doi.org/10.1007/s001530050168

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050168

Navigation