Anahit A. Chubaryan
Biography
Education
Yerevan State University, Department of mechanic and mathematic: 1964 - 1969,
PhD - education: 1969 - 1972

Academic degree
Candidate thesis “On proof complexity characteristics in some logical calculus”, 1978, NC, SA of USSR, Moscow
Doctoral thesis “Investigation of proof complexity characteristics in logical
and logic-mathematical systems”, 2007, IPIA of NAS RA, Yerevan

Professional experience
YSU, chair of “Mathematical cybernetic” lecture: 1972-1976
senior lecture: 1976 - 1982
associate professor: 1982 - 2009
chair of “Theory of systems” holder of the chair: 1986 - 1991
chair of “Discrete mathematic and informatic” full professor: 2009 - at present

Academic courses
Theory of algorithm, mathematical logic, discrete mathematic,
Common complexity theory, proof complexity

Scale of professional interests
Mathematical logic, proof theory, proof complexity

Participation in grant projects
Grant of SCS of RA (code 11-1b023)

Languages
Armenian, Russian, English, Germany

Professional membership
Member of 1) specialized council 044 “Mathematical cybernetic and mathematical logic” of SCC of RA by YSU 2) Armenian mathematical society 3) of Association of Symbolic Logic

achubaryan@ysu.am

Anahit A. Chubaryan

Professor | Faculty of Informatics and Applied Mathematics - Chair of Discrete Mathematics and Theoretical Informatics
 
 

Book

Ա. Ա. Չուբարյան, Հ. Գ. Մովսեսյան, Ս. Մ. Սայադյան

Հաշվարկելիության բարդության տեսության հիմնադրույթները | Ուս. ձեռնարկ: ԵՊՀ հրատ.: 2017թ․, 62 էջ

Anahit Chubaryan, Artur Khamisyan, Garik Petrosyan

On some systems for two versions of many-valued logics | LAP (Lambert Academic Publishing). 2017, 73 p.

A. A. Chubaryan

Rabin style speed-up of proofs | Monograph, LAP (Lambert Academic Publishing), Germany, 2010

, Anahit A. Chubaryan

Proof Complexity of Hard-determinable Formula in R(lin) | ASL ESM, LC-2009, Abstracts, Sofia, 27

A. A. Chubaryan, H. R. Bolibekyan, H. Movsisyan

Ալգորիթմների տեսության խնդիրների ժողովածու | Ուսումնական ձեոնարկ, ԵՊՀ հրատարակչություն, Երևան-2008 և http:users.freenet.am/~bolibek
1   2  |  See all
 

Article

Anahit Chubaryan

Universal system for many-valued logic, based on splitting method, and some of its properties | International Journal of Innovative Studies in Sciences and Engineering Technology, 2019, Volume 5, Issue 5, pp. 52-55 |

Anahit Chubaryan, Sergey Sayadyan

On the Proof Complexities of Strongly Equal Non-classical Tautologies | Advances in Mathematics and Computer Science, 2019, Vol. 1 Chapter 6, pp. 105-112 |

A. A. Chubaryan, H. A. Tamazyan

On lower bounds for proofs sizes in Frege systems | ՀՀ ԳԱԱ զեկույցներ, 2019, 119, 2, էջ 116-121 |

Anahit Chubaryan, Garik Petrosyan

On the relations between the proof complexity measures of strongly equal k-tautologies in some proof systems | Logic Colloquium 2018. 122-123 pp. |

Anahit Chubaryan, Artur Khamisyan

Two types of universal proof systems for all variants of many-valued logics and some properties of them | Iran Journal of Computer Science. 2018, 1, 1-8 pp. |
1   2   3   4   5   6   7   8   9   13  |  See all
 

Thesis

Anahit Chubaryan, Garik Petrosyan, Sergey Sayadyan

Monotonous and strong monotonous properties of some propositional proof systems for Classical and Non Classical Logics | Logic Colloquium 2019. pp. 165-166 |

Anahit Chubaryan, Artur Khamisyan

On the proof complexity in two universal proof system for all versions of many-valued logics | Logic Colloquium 2019, p. 152-153 |

Anahit Chubaryan, Artur Khamisyan

On some universal proof system for all versions of many-valued logics | Logic Colloquium 2018. p. 95-96 |

Anahit Chubaryan, Artur Khamisyan

Application of Kalmar’s proof of deducibility in two valued propositional logic for many valued logic | ASL, ESM, Logic Colloquium – 2017. p. 97 |

Anahit Chubaryan, Garik Petrosyan

On proof complexities for some classes of tautologies in Frege systems | ASL, ESM, Logic Colloquium – 2017. p. 99 |
1   2   3   4   5   6   7   8   9  |  See all