RUS  ENG
Full version
JOURNALS // Algebra i logika

Algebra Logika, 2008, Volume 47, Number 3, Pages 335–363 (Mi al362)

$\Sigma$-Definability of countable structures over real numbers, complex numbers, and quaternions
A. S. Morozov, M. V. Korovina

References

1. Yu. L. Ershov, Opredelimost i vychislimost, Sibirskaya shkola algebry i logiki, Nauchnaya kniga (NII MIOO NGU), Novosibirsk, 1996  mathscinet  zmath
2. J. Barwise, Admissible sets and structures, Springer-Velag, Berlin, 1975  mathscinet  zmath
3. C. C. Goncharov, Yu. L. Ershov, Konstruktivnye modeli, Sibirskaya shkola algebry i logiki, Nauchnaya kniga (NII MIOO NGU), Novosibirsk, 1996
4. Yu. L. Ershov, “$\Sigma$-definability of algebraic systems”, Handbook of recursive mathematics. Vol. 1: Recursive model theory, Stud. Logic Found. Math., 138, eds. Yu. L. Ershov et al., Elsevier, Amsterdam, 1998, 235–260  mathscinet  zmath
5. Kh. Rodzhers, Teoriya rekursivnykh funktsii i effektivnaya vychislimost, Mir, M., 1972  mathscinet
6. R. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967  mathscinet  zmath
7. G. E. Sacks, Higher recursion theory, Perspect. Math. Log., Springer-Verlag, Berlin etc., 1990  mathscinet


© Steklov Math. Inst. of RAS, 2026