We establish the reciprocal Σ-definability of the hereditarily finite superstructure and the hereditarily finite list superstructure over an arbitrary model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yu. L. Ershov, Definability and Computability, Consultants Bureau, New York, NY (1996).
Yu. L. Ershov, V. G. Puzarenko, and A. I. Stukachev, “HF-computability,” In: Computability in Context. Computation and Logic in the Real World, pp. 169–242, Imperial College Press, London (2011).
A. S. Morozov, “Nonpresentability of the semigroup ωω over ℍ𝔽(R),” Sib. Math. J.55, No. 1, 125–131 (2014).
A. S. Morozov, “Σ-presentations of the ordering on the reals,” Algebra Logic53, No. 3, 217–237 (2014).
A. S. Morozov, “Σ-rigid presentations of the real order,” Sib. Math. J.55, No. 3, 457–464 (2014).
A. S. Morozov, “Some presentations of the real number field,” Algebra Logic51, No. 1, 66–88 (2012).
A. S. Morozov and M. V. Korovina, “Σ-definability of countable structures over real numbers, complex numbers, and quaternions,” Algebra Logic47, No. 3, 193–209 (2008).
S. S. Goncharov and D. I. Sviridenko, “Σ-programming,” Transl., Ser. 2, Am. Math. Soc.142, 101–121 (1989).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Sibirskii Zhurnal Chistoi i Prikladnoi Matematiki18, No. 1, 2018, pp. 3-10.
Rights and permissions
About this article
Cite this article
Aleksandrova, S.A. On Σ-Definability Over Hereditarily Finite and List Superstructures. J Math Sci 246, 701–708 (2020). https://doi.org/10.1007/s10958-020-04774-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-020-04774-5