Vsevolod Oparin


Ph.D. St. Petersburg Academic University 2016 Russia
Dissertation: The thesis is dedicated to proof complexity of the systems, based on resolution rule. The results can be divided into three groups, that cover upper bounds for resolution based systems, extension of resolution to non-binary alphabet, and avoidability problem for partial words, considered with the prospect of proof complexity.
Mathematics Subject Classification: 03—Mathematical logic and foundations

Advisor 1: Dmitry Itsykson

No students known.

If you have additional information or corrections regarding this mathematician, please use the update form. To submit students of this mathematician, please use the new data form, noting this mathematician's MGP ID of 211481 for the advisor ID.