default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergei Starchenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Artem Chernikov, Sergei Starchenko:
Model-theoretic Elekes-Szabó in the strongly minimal case. J. Math. Log. 21(2): 2150004:1-2150004:20 (2021)
2010 – 2019
- 2016
- [i1]Artem Chernikov, David J. Galvin, Sergei Starchenko:
Cutting lemma and Zarankiewicz's problem in distal structures. CoRR abs/1612.00908 (2016) - 2014
- [j14]Pierre Simon, Sergei Starchenko:
On Forking and Definability of Types in some DP-Minimal Theories. J. Symb. Log. 79(4): 1020-1024 (2014) - 2013
- [j13]Zoé Chatzidakis, David Marker, Amador Martin-Pizarro
, Rahim Moosa, Sergei Starchenko:
Introduction. Notre Dame J. Formal Log. 54(3-4): 277 (2013) - [j12]Matthias Aschenbrenner, Alf Dolich, Deirdre Haskell, Dugald Macpherson, Sergei Starchenko:
Vapnik-Chervonenkis Density in Some Theories without the Independence Property, II. Notre Dame J. Formal Log. 54(3-4): 311-363 (2013) - 2012
- [j11]Paola D'Aquino, Julia F. Knight, Sergei Starchenko:
Corrigendum to: "Real closed fields and models of arithmetic". J. Symb. Log. 77(2): 726 (2012) - [j10]Sarah Cotter, Sergei Starchenko:
Forking in VC-minimal theories. J. Symb. Log. 77(4): 1257-1271 (2012) - 2010
- [j9]Paola D'Aquino, Julia F. Knight, Sergei Starchenko:
Real closed fields and models of Peano arithmetic. J. Symb. Log. 75(1): 1-11 (2010)
2000 – 2009
- 2007
- [j8]Pantelis E. Eleftheriou, Sergei Starchenko:
Groups definable in ordered vector spaces over ordered division rings. J. Symb. Log. 72(4): 1108-1140 (2007) - 2003
- [j7]Ya'acov Peterzil, Sergei Starchenko:
Expansions of Algebraically closed Fields II: Functions of several Variables. J. Math. Log. 3(1) (2003)
1990 – 1999
- 1999
- [j6]Ya'acov Peterzil, Sergei Starchenko:
Definable Homomorphisms of Abelian Groups in oMminimal Structures. Ann. Pure Appl. Log. 101(1): 1-27 (1999) - 1996
- [j5]Ya'acov Peterzil, Sergei Starchenko:
Geometry, calculus and Zil'ber's conjecture. Bull. Symb. Log. 2(1): 72-83 (1996) - 1995
- [j4]Bradd Hart, Anand Pillay, Sergei Starchenko:
1-based theories - the main gap fora-models. Arch. Math. Log. 34(5): 285-300 (1995) - 1994
- [j3]Bradd Hart, Sergei Starchenko:
Superstable Quasi-Varieties. Ann. Pure Appl. Log. 69(1): 53-71 (1994) - 1993
- [j2]Bradd Hart, Anand Pillay, Sergei Starchenko:
Triviality, NDOP and Stable Varieties. Ann. Pure Appl. Log. 62(2): 119-146 (1993) - [j1]Bradd Hart, Sergei Starchenko:
Addendum to "A Structure Theorem for Strongly Abelian Varieties". J. Symb. Log. 58(4): 1419-1425 (1993)
1980 – 1989
- 1988
- [c1]Sergei Starchenko, Andrei Voronkov:
On connections between classical and constructive semantics. Conference on Computer Logic 1988: 275-285
Coauthor Index
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-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
