Vsevolod Oparin
Original record- Institution
- St. Petersburg Academic University
- Year
- 2016
- Country
- Russia
- MGP identifier
- 211481
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 ItsyksonSt. Petersburg State University and Steklov Institute of Mathematics, St. Petersburg · 2009
Students 0
No students recorded in this snapshot.