More undecidable lattices of Steinitz exchange systems

Journal of Symbolic Logic 67 (2):859-878 (2002)
  Copy   BIBTEX

Abstract

We show that the first order theory of the lattice $\mathscr{L}^{ (S) of finite dimensional closed subsets of any nontrivial infinite dimensional Steinitz Exhange System S has logical complexity at least that of first order number theory and that the first order theory of the lattice L(S ∞ ) of computably enumerable closed subsets of any nontrivial infinite dimensional computable Steinitz Exchange System S ∞ has logical complexity exactly that of first order number theory. Thus, for example, the lattice of finite dimensional subspaces of a standard copy of $\bigoplus_\omega$ Q interprets first order arithmetic and is therefore as complicated as possible. In particular, our results show that the first order theories of the lattice L(V ∞ ) of c.e. subspaces of a fully effective ℵ 0 -dimensional vector space V∞ and the lattice of c.e. algebraically closed subfields of a fully effective algebraically closed field F ∞ of countably infinite transcendence degree each have logical complexity that of first order number theory

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
21 (#631,231)

6 months
1 (#1,042,085)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Automorphisms of substructure lattices in recursive algebra.David R. Guichard - 1983 - Annals of Pure and Applied Logic 25 (1):47-58.
Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.
Intersections of algebraically closed fields.C. J. Ash & John W. Rosenthal - 1986 - Annals of Pure and Applied Logic 30 (2):103-119.

View all 12 references / Add more references