Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
All
Since 2019
Citations
13
13
h-index
3
3
i10-index
0
0
0
6
3
2021
2022
2023
2024
6
3
1
3
Follow
Mikhail R. Starchak
St. Petersburg University
Verified email at spbu.ru -
Homepage
Logic in computer science
Articles
Cited by
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
A proof of Bel’tyukov–Lipshitz theorem by quasi-quantifier elimination. I. Definitions and GCD-lemma
MR Starchak
Vestnik St. Petersburg University, Mathematics 54 (3), 264-272
, 2021
6
2021
A Proof of Bel’tyukov–Lipshitz Theorem by Quasi-Quantifier Elimination. II. The Main Reduction
MR Starchak
Vestnik St. Petersburg University, Mathematics 54 (4), 372-380
, 2021
3
2021
Positive Existential Definability with Unit, Addition and Coprimeness
MR Starchak
Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …
, 2021
3
2021
On the Existential Arithmetics with Addition and Bitwise Minimum
MR Starchak
Foundations of Software Science and Computation Structures: 26th …
, 2023
1
2023
Quasi-Quantifier Elimination Algorithms and Definability Problems in Arithmetics with Divisibility
MR Starchak
St. Petersburg University
, 2022
2022
Quantifier Elimination Approach to Existential Linear Arithmetic with GCD
MR Starchak
2021
The system can't perform the operation now. Try again later.
Articles 1–6
Show more
Privacy
Terms
Help
About Scholar
Search help