![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Artem Chernikov
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Artem Chernikov, Henry Towsner:
Perfect stable regularity lemma and slice-wise stable hypergraphs. CoRR abs/2402.07870 (2024) - 2023
- [j11]Artem Chernikov, Ehud Hrushovski, Alex Kruckman, Krzysztof Krupinski, Slavko Moconja, Anand Pillay, Nicholas Ramsey
:
Invariant measures in simple and in small theories. J. Math. Log. 23(2): 2250025:1-2250025:37 (2023) - [j10]Artem Chernikov
, Byunghan Kim, Nicholas Ramsey
:
Transitivity, Lowness, and ranks in Nsop Theories. J. Symb. Log. 88(3): 919-946 (2023) - 2021
- [j9]Artem Chernikov, Sergei Starchenko:
Model-theoretic Elekes-Szabó in the strongly minimal case. J. Math. Log. 21(2): 2150004:1-2150004:20 (2021) - 2020
- [i2]Artem Chernikov, Henry Towsner:
Hypergraph regularity and higher arity VC-dimension. CoRR abs/2010.00726 (2020)
2010 – 2019
- 2019
- [j8]Artem Chernikov, Pierre Simon:
Henselian Valued Fields and InP-Minimality. J. Symb. Log. 84(4): 1510-1526 (2019) - [j7]Artem Chernikov, Daniel Palacín
, Kota Takeuchi:
On n-Dependence. Notre Dame J. Formal Log. 60(2): 195-214 (2019) - 2018
- [j6]Artem Chernikov:
Model theory, Keisler measures, and groups - Ehud Hrushovski, Ya'acov Peterzil and Anand Pillay, Groups, measures, and the NIP. Journal of the American Mathematical Society, vol. 21 (2008), no. 2, pp. 563-596. - Ehud Hrushovski and Anand Pillay, On NIP and invariant measures. Journal of the European Mathematical Society, vol.13 (2011), no. 4, pp. 1005-1061. - Ehud Hrushovski, Anand Pillay, and Pierre Simon, Generically stable and smooth measures in NIP theories. Transactions of the American Mathematical Society, vol. 365 (2013), no. 5, pp. 2341-2366. Bull. Symb. Log. 24(3): 336-339 (2018) - 2016
- [j5]Artem Chernikov, Nicholas Ramsey
:
On model-theoretic tree properties. J. Math. Log. 16(2): 1650009:1-1650009:41 (2016) - [i1]Artem Chernikov, David J. Galvin, Sergei Starchenko:
Cutting lemma and Zarankiewicz's problem in distal structures. CoRR abs/1612.00908 (2016) - 2014
- [j4]Artem Chernikov:
Theories without the tree property of the second kind. Ann. Pure Appl. Log. 165(2): 695-723 (2014) - [j3]Artem Chernikov, Anand Pillay, Pierre Simon:
External definability and groups in NIP theories. J. Lond. Math. Soc. 90(1): 213-240 (2014) - [j2]Itaï Ben Yaacov, Artem Chernikov:
An Independence Theorem for Ntp2 Theories. J. Symb. Log. 79(1): 135-153 (2014) - 2012
- [j1]Artem Chernikov, Itay Kaplan
:
Forking and dividing in NTP₂ theories. J. Symb. Log. 77(1): 1-20 (2012)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint