Abstract
We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.
Similar content being viewed by others
References
R. R. Avdeev, “On the admissible sets of type HYP(M) over recursively saturated models,” Sib. Matem. Zh. 52, 1199 (2011) [Siberian Math. J.52, 951 (2011)].
J. Barwise, Admissible Sets and Structures (Springer-Verlag, Berlin-Göttingen-Heidelberg, 1975).
C. C. Chang and H. J. Keisler, Model Theory (North-Holland, Amsterdam, 1990).
Yu. L. Ershov, Decision Problems and Constructivizable Models (Nauka, Moscow, 1980) [in Russian].
Yu. L. Ershov, “Σ-definability in admissible sets,” Dokl. Akad. Nauk SSSR 285, 792 (1985) [Soviet Math., Dokl. 32, 767 (1985)].
Yu. L. Ershov, Definability and Computability (Nauchnaya Kniga, Novosibirsk, 1996) [Definability and Computability (Consultants Bureau, New York, 1996)].
Yu. L. Ershov and S. S. Goncharov, Constructive Models (Nauchnaya Kniga, Novosibirsk, 1999) [Constructive Models (Consultants Bureau, New York, 2000)].
Yu. L. Ershov, V. G. Puzarenko, and A. I. Stukachev, “HF-computability,” in Computability in Context. Computation and Logic in the Real World, 169 (Imperial College Press, London, 2011).
S. S. Goncharov, Countable Boolean Algebras and Decidability (Nauchnaya Kniga, Novosibirsk, 1996) [Countable Boolean Algebras and Decidability (Consultants Bureau, New York, 1997)].
M. Harrison-Trainor, A. Melnikov, R. Miller, and A. Montalb'an, “Computable functors and effective inter-pretability,” J. Symbolic Logic 82, 77 (2017).
A. N. Khisamiev, “On the Ershov upper semilattice ♠E,” Sib. Matem. Zh. 45, 211 (2004) [Siberian Math. J. 45, 173 (2004)].
O. Melnikov, R. I. Tyshkevich, V. A. Yemelichev, and V. I. Sarvanov, Lectures on Graph Theory (Nauka, Moscow, 1990) [Lectures on Graph Theory (B. I. Wissenschaftsverlag, Mannheim, 1994)].
V. G. Puzarenko, “Computability overmodels of decidable theories,” Algebra ilogika 39, 170 (2000) [Algebra and Logic 39, 98 (2000)].
V. G. Puzarenko, “Generalized numerations and definability of the field R in admissible sets,” Vestnik Novosibirsk. Gos. Univ., Ser. Mat. Mekh. Inform. 3,no. 2, 107 (2003) [in Russian].
V. G. Puzarenko, “Computability in special models,” Sib. Matem. Zh. 46, 185 (2005) [Siberian Math. J. 46, 148 (2005)].
V. G. Puzarenko, “A certain reducibility on admissible sets,” Sib. Matem. Zh. 50, 414 (2009) [Siberian Math. J. 50, 330 (2009)].
A. I. Stukachev, “Degrees of presentability of structures. I,” Algebra i logika 46, 763 (2007) [Algebra and Logic 46, 419 (2007)].
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © The Author(s), 2018, published in Matematicheskie Trudy, 2018, Vol. 21, No. 2, pp. 3–60.
About this article
Cite this article
Avdeev, R.R., Puzarenko, V.G. A Computable Structure with Non-Standard Computability. Sib. Adv. Math. 29, 77–115 (2019). https://doi.org/10.3103/S1055134419020019
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1055134419020019