Reference23 articles.
1. Ershov Yu. L., “$ \Sigma $-Definability in admissible sets,” Soviet Math. Dokl., vol. 32, no. 4, 767–770 (1985).
2. Ershov Yu. L., Definability and Computability, Kluwer/Consultants Bureau, New York and London (1996).
3. Ershov Yu. L., “$ \Sigma $-Definability of algebraic structures,” in: Handbook of Recursive Mathematics. Vol. 1: Recursive Model Theory, Elsevier, Amsterdam, Lausanne, New York, Oxford, Shannon, Singapore, and Tokyo (1998), 235–260 (Stud. Logic Found. Math.; Vol. 138).
4. Stukachev A. I., “Effective model theory via the $ \Sigma $-definability approach,” in: Lecture Notes in Logic, vol. 41, Cambridge Univ., Cambridge (2013), 164–197.
5. Stukachev A. I., “$ \Sigma $-Definability of uncountable models of $ c $-simple theories,” Sib. Math. J., vol. 51, no. 3, 515–524 (2010).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Generalized Computable Models and Montague Semantics;Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021);2023