Artem Chernikov

dblp:74/10857 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
2since 2021 · last 2025
0000-0002-9136-8737ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 5 first-author · 2 since 2021
YearPublicationVenuePosition
2025 Semi-Equational Theories
abstract
Abstract We introduce and study (weakly) semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong honest definitions; demonstrate that certain trees are semi-equational, while algebraically closed valued fields are not weakly semi-equational; and obtain a general criterion for weak semi-equationality of an expansion of a distal structure by a new predicate.
Artem Chernikov, Alex Mennen
J. Symb. Log.1
2023 Transitivity, Lowness, and ranks in Nsop Theories
abstract
Abstract We develop the theory of Kim-independence in the context of NSOP $_{1}$ theories satisfying the existence axiom. We show that, in such theories, Kim-independence is transitive and that -Morley sequences witness Kim-dividing. As applications, we show that, under the assumption of existence, in a low NSOP $_{1}$ theory, Shelah strong types and Lascar strong types coincide and, additionally, we introduce a notion of rank for NSOP $_{1}$ theories.
Artem Chernikov, Byunghan Kim, Nicholas Ramsey
J. Symb. Log.1
2019 Henselian Valued Fields and InP-Minimality
abstract
Abstract We prove that every ultraproduct of p-adics is inp-minimal (i.e., of burden 1). More generally, we prove an Ax-Kochen type result on preservation of inp-minimality for Henselian valued fields of equicharacteristic 0 in the RV language.
Artem Chernikov, Pierre Simon
J. Symb. Log.1
2014 Theories without the tree property of the second kind
Artem Chernikov
Ann. Pure Appl. Log.1
2014 An Independence Theorem for Ntp2 Theories
abstract
Abstract We establish several results regarding dividing and forking in NTP2theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain condition over extension bases (namely, the forking ideal is S1, in Hrushovski’s terminology). Using it we prove an independence theorem over extension bases (which, in the case of simple theories, specializes to the ordinary independence theorem). As an application we show that Lascar strong type and compact strong type coincide over extension bases in an NTP2theory. We also define the dividing order of a theory—a generalization of Poizat’s fundamental order from stable theories—and give some equivalent characterizations under the assumption of NTP2. The last section is devoted to a refinement of the class of strong theories and its place in the classification hierarchy.
Itay Ben-Yaacov, Artem Chernikov
J. Symb. Log.2
2012 Forking and dividing in NTP₂ theories
abstract
Abstract We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded non-forking assuming NTP2.
Artem Chernikov, Itay Kaplan
J. Symb. Log.1