Abstract
Cohesive sets play an important role in computability theory. Here we use cohesive sets to build nonstandard versions of the rationals. We use Koenigsmann’s work on Hilbert’s Tenth Problem to establish that these nonstandard fields are rigid. As a consequence we obtain results about automorphisms of the lattices of computably enumerable vector spaces arising in the context of Ash’s conjecture.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Davis, M., Matiyasevich, Y., Robinson, J.: Hilbert’s tenth problem: Diophantine equations: positive aspects of a negative solution, Mathematical developments arising from Hilbert problems. In: Proc. Sympos. Pure Math., vol. XXVIII, Northern Illinois Univ, De Kalb, Ill (1974); Amer. Math. Soc., Providence, RI, pp. 323–378 (1976)
Dimitrov, R.D.: Quasimaximality and principal filters isomorphism between \(\mathcal{E}^{\ast }\) and \(\mathcal{L}^{\ast }(V_{\infty })\). Arch. Math. Logic 43, 415–424 (2004)
Dimitrov, R.D.: A class of \(\Sigma _{3}^{0}\) modular lattices embeddable as principal filters in \(\mathcal{L}^{\ast }(V_{\infty }) \). Arch. Math. Logic 47(2), 111–132 (2008)
Dimitrov, R.D.: Cohesive powers of computable structures, Annuare De L’Universite De Sofia “St. Kliment Ohridski”. Fac. Math. and Inf., Tome 99, 193–201 (2009)
Dimitrov, R.D.: Extensions of certain partial automorphisms of \(\mathcal{L}^{\ast }(V_{\infty })\), Annuare De L’Universite De Sofia “St. Kliment Ohridski”. Fac. Math. and Inf., Tome 99, 183–191 (2009)
Feferman, S., Scott, D.S., Tennenbaum, S.: Models of arithmetic through function rings. Notices Amer. Math. Soc. 6, 173. Abstract #556-31 (1959)
Guichard, D.R.: Automorphisms of substructure lattices in recursive algebra. Ann. Pure Appl. Logic 25(1), 47–58 (1983)
Hirschfeld, J.: Models of arithmetic and recursive functions. Israel Journal of Mathematics 20(2), 111–126 (1975)
Hirschfeld, J., Wheeler, W.: Forcing, arithmetic, division rings. Lecture Notes in Mathematics, vol. 454. Springer, Berlin (1975)
Robinson, J.: Definability and decision problems in arithmetic. Journal of Symbolic Logic 14(2), 98–114 (1949)
Koenigsmann, J.: Defining ℤ in ℚ, forthcoming in the Annals of Mathematics, http://arxiv.org/abs/1011.3424
Lerman, M.: Recursive functions modulo co-r-maximal sets. Transactions of the American Mathematical Society 148(2), 429–444 (1970)
McLaughlin, T.: Some extension and rearrangement theorems for Nerode semirings, Zeitschr. f. math. Logic und Grundlagen d. Math. 35, 197–209 (1989)
McLaughlin, T.: Sub-arithmetical ultrapowers: a survey. Annals of Pure and Applied Logic 49(2), 143–191 (1990)
McLaughlin, T.: Δ1 ultrapowers are totally rigid. Archive for Mathematical Logic 46, 379–384 (2007)
Metakides, G., Nerode, A.: Recursively enumerable vector spaces. Annals of Mathematical Logic 11, 147–171 (1977)
Robinson, R.: Arithmetical definitions in the ring of integers. Proceedings of the American Mathematical Society 2(2), 279–284 (1951)
Soare, R.I.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Springer, Berlin (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Dimitrov, R., Harizanov, V., Miller, R., Mourad, K.J. (2014). Isomorphisms of Non-Standard Fields and Ash’s Conjecture. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-08019-2_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08018-5
Online ISBN: 978-3-319-08019-2
eBook Packages: Computer ScienceComputer Science (R0)