\Bibitem{Kud96}
\by O.~V.~Kudinov
\paper An autostable $1$-decidable model without a computable
Scott family of $\exists$-formulas
\jour Algebra Logika
\yr 1996
\vol 35
\issue 4
\pages 458--467
\mathnet{http://mi.mathnet.ru/al2362}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1444430}
Linking options:
https://www.mathnet.ru/eng/al2362
https://www.mathnet.ru/eng/al/v35/i4/p458
This publication is cited in the following 24 articles:
Marina Dorzhieva, Rodney Downey, Ellen Hammatt, Alexander G. Melnikov, Keng Meng Ng, “Punctually presented structures II: comparing presentations”, Arch. Math. Logic, 2024
S. S. Goncharov, V. Harizanov, R. Miller, “On Decidable Categoricity and Almost Prime
Models”, Sib. Adv. Math., 30:3 (2020), 200
N. A. Bazhenov, M. Harrison-Trainor, “Constructing decidable graphs from decidable structures”, Algebra and Logic, 58:5 (2019), 369–382
Ekaterina Fokina, Valentina Harizanov, Daniel Turetsky, “Computability-theoretic categoricity and Scott families”, Annals of Pure and Applied Logic, 170:6 (2019), 699
N. A. Bazhenov, “Categoricity spectra of computable structures”, J. Math. Sci. (N. Y.), 256:1 (2021), 34–50
Russell Miller, Lecture Notes in Computer Science, 10010, Computability and Complexity, 2017, 254
E. B. Fokina, S. S. Goncharov, V. Harizanov, O. V. Kudinov, D. Turetsky, “Index sets for $n$-decidable structures categorical relative to $m$-decidable presentations”, Algebra and Logic, 54:4 (2015), 336–341
P. E. Alaev, “Ash’s theorem on $\Delta^0_\alpha$-categorical structures and a condition for infinite $\Delta^0_\alpha$-dimension”, Algebra and Logic, 54:5 (2015), 353–369
Russell Miller, Alexandra Shlapentokh, “Computable categoricity for algebraic fields with splitting algorithms”, Trans. Amer. Math. Soc., 367:6 (2014), 3955
Denis Hirschfeldt, Ken Kramer, Russell Miller, Alexandra Shlapentokh, “Categoricity properties for computable algebraic fields”, Trans. Amer. Math. Soc., 367:6 (2014), 3981
Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124
Reed Solomon, “2010 North American Annual Meeting of the Association for Symbolic Logic”, Bull. symb. log, 17:1 (2011), 127
D. A. Tusupov, “An autostable 2 nilpotent group with no Scott family of finitary formulas”, Siberian Math. J., 48:6 (2007), 1106–1114
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stephan, “Applications of Kolmogorov complexity to computable model theory”, J. symb. log., 72:3 (2007), 1041
Peter Cholak, Richard A. Shore, Reed Solomon, “A computably stable structure with no Scott family of finitary formulas”, Arch. Math. Logic, 45:5 (2006), 519
Wesley Calvert, Douglas Cenzer, Valentina Harizanov, Andrei Morozov, “Effective categoricity of equivalence structures”, Annals of Pure and Applied Logic, 141:1-2 (2006), 61
Steffen Lempp, Charles McCoy, Russell Miller, Reed Solomon, “Computable categoricity of trees of finite height”, J. symb. log., 70:1 (2005), 151
R. Downey, D. Hirschfeldt, B. Khoussainov, “Uniformity in Computable Structure Theory”, Algebra and Logic, 42:5 (2003), 318–332
Walker M. White, “On the complexity of categoricity in computable structures”, Mathematical Logic Qtrly, 49:6 (2003), 603
Studies in Logic and the Foundations of Mathematics, 144, Computable Structures and the Hyperarithmetical Hierarchy, 2000, 323
Citation in format AMSBIB
Contact us: