Mikhaĭl G. Peretyat'kin

From MaRDI portal
Revision as of 01:00, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:779151

Available identifiers

zbMath Open peretyatkin.mikhail-gMaRDI QIDQ779151

List of research outcomes





PublicationDate of PublicationType
The Tarski-Lindenbaum algebra of the class of prime models with infinite algorithmic dimensions having omega-stable theories2024-11-26Paper
Virtual algebraic isomorphisms between predicate calculi of finite rich signatures2022-06-15Paper
https://portal.mardi4nfdi.de/entity/Q33798092021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33798242021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33798592021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33801462021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33801902021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33802312021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33802632021-09-27Paper
The property of being a model complete theory is preserved by Cartesian extensions2020-11-24Paper
The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one2020-07-21Paper
First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories2017-02-09Paper
A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic2016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q51776972015-03-05Paper
The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models2013-08-05Paper
On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models2012-08-14Paper
THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS2003-05-15Paper
https://portal.mardi4nfdi.de/entity/Q45139752001-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42493642001-01-07Paper
https://portal.mardi4nfdi.de/entity/Q47006141999-11-04Paper
https://portal.mardi4nfdi.de/entity/Q43623141997-10-29Paper
https://portal.mardi4nfdi.de/entity/Q48953241996-10-14Paper
Expressive power of finitely axiomatizable theories. I: Introduction, interpretations, and reductions to graphs1996-08-28Paper
Expressive power of finitely axiomatizable theories. II: Rigid quasi-succession1996-08-28Paper
Expressive power of finitely axiomatizable theories. III: The main construction1996-08-27Paper
Semantically universal classes of models1993-06-29Paper
Analogues of Rice's theorem for semantic classes of propositions1993-06-29Paper
Semantic universality of theories over a superlist1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40269321993-02-21Paper
Uncountably categorical quasisuccession of Morley rank 31992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40000011992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q33626111991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34816831990-01-01Paper
Finitely axiomatizable theories1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38138011987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37554401985-01-01Paper
Turing machine computations in finitely axiomatizable theories1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30373961982-01-01Paper
Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory1981-01-01Paper
Theories with three countable models1981-01-01Paper
Criterion for strong constructivizability of a homogeneous model1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38678121978-01-01Paper
On complete theories with a finite number of denumerable models1975-01-01Paper
Every recursive enumerable extension of a theory of linear order has a constructive model1974-01-01Paper
Strongly constructive model without elementary submodels and extensions1974-01-01Paper
Definability in structures of finite valency1974-01-01Paper
Strongly constructive models and numerations of the Boolean algebra of recursive sets1973-01-01Paper

Research outcomes over time

This page was built for person: Mikhaĭl G. Peretyat'kin