RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Peretyat'kin, Mikhail Georgievich

Statistics Math-Net.Ru
Total publications: 16
Scientific articles: 15

Number of views:
This page:293
Abstract pages:1277
Full texts:595
References:20

http://www.mathnet.ru/eng/person24099
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
2020
1. M. G. Peretyat'kin, “The property of being a model complete theory is preserved by Cartesian extensions”, Sib. Èlektron. Mat. Izv., 17 (2020),  1540–1551  mathnet  isi
2. M. G. Peretyat'kin, “The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one”, Sib. Èlektron. Mat. Izv., 17 (2020),  913–922  mathnet  isi
2015
3. M. G. Peretyat'kin, “First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories”, Mat. Tr., 18:2 (2015),  61–92  mathnet  mathscinet  elib; Siberian Adv. Math., 26:3 (2016), 196–214
1992
4. M. G. Peretyat'kin, “Semantic universality of theories over a superlist”, Algebra Logika, 31:1 (1992),  47–73  mathnet  mathscinet
1991
5. M. G. Peretyat'kin, “Analogues of Rice's theorem for semantic classes of propositions”, Algebra Logika, 30:5 (1991),  517–539  mathnet  mathscinet
6. M. G. Peretyat'kin, “Semantically universal classes of models”, Algebra Logika, 30:4 (1991),  414–431  mathnet  mathscinet
7. M. G. Peretyat'kin, “Uncountably categorical quasisuccession of Morley rank 3”, Algebra Logika, 30:1 (1991),  74–89  mathnet  mathscinet; Algebra and Logic, 30:1 (1991), 51–61
1989
8. M. G. Peretyat'kin, “The similarity of properties of recursively enumerable and finitely axiomatizable theories”, Dokl. Akad. Nauk SSSR, 308:4 (1989),  788–791  mathnet  mathscinet  zmath; Dokl. Math., 40:2 (1990), 372–375
1982
9. M. G. Peretyat'kin, “Calculations on Turing machines in finitely axiomatizable theories”, Algebra Logika, 21:4 (1982),  410–441  mathnet  mathscinet
1980
10. M. G. Peretyat'kin, “Example of an $\omega _{1}$-categorical complete finitely axiomatizable theory”, Algebra Logika, 19:3 (1980),  314–347  mathnet  mathscinet
11. M. G. Peretyat'kin, “A theory with three countable models”, Algebra Logika, 19:2 (1980),  224–235  mathnet  mathscinet
1978
12. M. G. Peretyat'kin, “A criterion of strong constructivizability of a homogeneous model”, Algebra Logika, 17:4 (1978),  436–454  mathnet  mathscinet
1973
13. M. G. Peretyat'kin, “Complete theories with a finite number of countable models”, Algebra Logika, 12:5 (1973),  550–576  mathnet  mathscinet
14. M. G. Peretyat'kin, “A strongly constructive model without elementary submodels and extensions”, Algebra Logika, 12:3 (1973),  312–322  mathnet  mathscinet
15. M. G. Peretyat'kin, “Every recursively enumerable extension of a theory of linear order has a constructive model”, Algebra Logika, 12:2 (1973),  211–219  mathnet  mathscinet
1971
16. M. G. Peretyat'kin, “Strongly constructive models and enumerations of the Boolean algebra of recursive sets”, Algebra Logika, 10:5 (1971),  535–557  mathnet  mathscinet

1990
17. S. S. Goncharov, Yu. L. Ershov, M. M. Lavrent'ev, L. L. Maksimova, T. G. Mustafin, S. P. Novikov, E. A. Palyutin, M. G. Peretyat'kin, Yu. G. Reshetnyak, D. M. Smirnov, “Asan Dabsovich Taimanov (obituary)”, Uspekhi Mat. Nauk, 45:5(275) (1990),  171–173  mathnet  mathscinet; Russian Math. Surveys, 45:5 (1990), 213–215  isi

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021