More undecidable lattices of Steinitz exchange systems
Journal of Symbolic Logic 67 (2):859-878 (2002)
| 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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesMichael Moses (2010). The Block Relation in Computable Linear Orders. Notre Dame Journal of Formal Logic 52 (3):289-305.
Lee Fong Low (1994). Lattice of Algebraically Closed Sets in One-Based Theories. Journal of Symbolic Logic 59 (1):311-321.
Josep Maria Font, Ramon Jansana & Don Pigozzi (2006). On the Closure Properties of the Class of Full G-Models of a Deductive System. Studia Logica 83 (1-3):215 - 278.
William C. Calhoun & Manuel Lerman (2001). Embedding Finite Lattices Into the Ideals of Computably Enumerable Turing Degrees. Journal of Symbolic Logic 66 (4):1791-1802.
Yuri Gurevich (1983). Decision Problem for Separated Distributive Lattices. Journal of Symbolic Logic 48 (1):193-196.
Douglas Cenzer & Andre Nies (2001). Initial Segments of the Lattice of Π01 Classes. Journal of Symbolic Logic 66 (4):1749 - 1765.
K. V. Adaricheva & V. A. Gorbunov (2004). On the Structure of Lattices of Subquasivarieties of Congruence-Noetherian Quasivarieties. Studia Logica 78 (1-2):35 - 44.
Alasdair Urquhart (1981). Distributive Lattices with a Dual Homomorphic Operation. II. Studia Logica 40 (4):391 - 404.
Allen Retzlaff (1978). Simple and Hyperhypersimple Vector Spaces. Journal of Symbolic Logic 43 (2):260-269.
C. J. Ash & R. G. Downey (1984). Decidable Subspaces and Recursively Enumerable Subspaces. Journal of Symbolic Logic 49 (4):1137-1145.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,556 of 548,984 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
