×

zbMATH — the first resource for mathematics

Peretyat’kin, Mikhail G.

Compute Distance To:
Author ID: peretyatkin.mikhail-g Recent zbMATH articles by "Peretyat’kin, Mikhail G."
Published as: Peretyat’kin, M. G.; Peretyat’kin, Mikhail G.; Peretyat’kin, Mikhaĭl G.; Peretyat’kin, Mikhail; Peretyatkin, Mikhail; Peretyatkin, M. G.
External Links: ORCID
Documents Indexed: 39 Publications since 1973, including 4 Books

Publications by Year

Citations contained in zbMATH Open

19 Publications have been cited 36 times in 27 Documents Cited by Year
On complete theories with a finite number of denumerable models. Zbl 0298.02047
Peretyat’kin, M. G.
6
1975
Finitely axiomatizable theories. (Konechno aksiomatiziruemye teorii.) Zbl 0893.03011
Peretyat’kin, M. G.
4
1997
Theories with three countable models. Zbl 0481.03015
Peretyat’kin, M. G.
4
1981
Strongly constructive models and numerations of the Boolean algebra of recursive sets. Zbl 0311.02051
Peretyat’kin, M. G.
3
1973
The Lindenbaum algebra of the theory of the class of all finite models. Zbl 1033.03035
Lempp, Steffen; Peretyatkin, Mikhail; Solomon, Reed
2
2002
Definability in structures of finite valency. Zbl 0276.02036
Korec, I.; Peretyat’kin, M. G.; Rautenberg, W.
2
1974
Finitely axiomatizable theories and similarity relations. Zbl 0929.03014
Peretyat’kin, M. G.
2
1999
Semantically universal classes of models. Zbl 0777.03010
Peretyat’kin, M. G.
2
1991
Expressive power of finitely axiomatizable theories. I: Introduction, interpretations, and reductions to graphs. Zbl 0848.03008
Peretyat’kin, M. G.
1
1993
Expressive power of finitely axiomatizable theories. III: The main construction. Zbl 0848.03010
Peretyat’kin, M. G.
1
1993
Finitely axiomatizable theories and Lindenbaum algebras of semantic classes. Zbl 0968.03039
Peretyat’kin, Mikhail
1
2000
A criterion for strong constructibility of homogeneous models. Zbl 0431.03021
Peretyat’kin, M. G.
1
1978
Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory. Zbl 0468.03016
Peretyat’kin, M. G.
1
1981
Every recursive enumerable extension of a theory of linear order has a constructive model. Zbl 0298.02045
Peretyat’kin, M. G.
1
1974
Similarity of the properties of recursively enumerable and finitely axiomatizable theories. Zbl 0703.03014
Peretyat’kin, M. G.
1
1990
The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models. Zbl 1433.03086
Peretyat’kin, Mikhail G.
1
2013
Semantical significances of formulas in the classical predicate logic. Zbl 0785.03023
Peretyatkin, M. G.
1
1992
Analogues of Rice’s theorem for semantic classes of propositions. Zbl 0777.03011
Peretyat’kin, M. G.
1
1991
First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories. Zbl 1374.03023
Peretyat’kin, M. G.
1
2015
First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories. Zbl 1374.03023
Peretyat’kin, M. G.
1
2015
The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models. Zbl 1433.03086
Peretyat’kin, Mikhail G.
1
2013
The Lindenbaum algebra of the theory of the class of all finite models. Zbl 1033.03035
Lempp, Steffen; Peretyatkin, Mikhail; Solomon, Reed
2
2002
Finitely axiomatizable theories and Lindenbaum algebras of semantic classes. Zbl 0968.03039
Peretyat’kin, Mikhail
1
2000
Finitely axiomatizable theories and similarity relations. Zbl 0929.03014
Peretyat’kin, M. G.
2
1999
Finitely axiomatizable theories. (Konechno aksiomatiziruemye teorii.) Zbl 0893.03011
Peretyat’kin, M. G.
4
1997
Expressive power of finitely axiomatizable theories. I: Introduction, interpretations, and reductions to graphs. Zbl 0848.03008
Peretyat’kin, M. G.
1
1993
Expressive power of finitely axiomatizable theories. III: The main construction. Zbl 0848.03010
Peretyat’kin, M. G.
1
1993
Semantical significances of formulas in the classical predicate logic. Zbl 0785.03023
Peretyatkin, M. G.
1
1992
Semantically universal classes of models. Zbl 0777.03010
Peretyat’kin, M. G.
2
1991
Analogues of Rice’s theorem for semantic classes of propositions. Zbl 0777.03011
Peretyat’kin, M. G.
1
1991
Similarity of the properties of recursively enumerable and finitely axiomatizable theories. Zbl 0703.03014
Peretyat’kin, M. G.
1
1990
Theories with three countable models. Zbl 0481.03015
Peretyat’kin, M. G.
4
1981
Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory. Zbl 0468.03016
Peretyat’kin, M. G.
1
1981
A criterion for strong constructibility of homogeneous models. Zbl 0431.03021
Peretyat’kin, M. G.
1
1978
On complete theories with a finite number of denumerable models. Zbl 0298.02047
Peretyat’kin, M. G.
6
1975
Definability in structures of finite valency. Zbl 0276.02036
Korec, I.; Peretyat’kin, M. G.; Rautenberg, W.
2
1974
Every recursive enumerable extension of a theory of linear order has a constructive model. Zbl 0298.02045
Peretyat’kin, M. G.
1
1974
Strongly constructive models and numerations of the Boolean algebra of recursive sets. Zbl 0311.02051
Peretyat’kin, M. G.
3
1973

Citations by Year