Anahit Chubaryan's Publications (Full profile)

Paper

  1. A. A. Chubaryan, H. R. Bolibekyan, On the Sequential Calculus of Minimal Robinsons Arithmetic, Congres 60ieme Anniversaire de Denis Richard, Clermont-Ferrand-France, 2002, DNAN of Armenia, Applied Mathematics, 102, (2002), (in Russian), 3, pp. 214-216, (2002)
  2. An. A. Chubaryan, ArmA. Chubaryan, On the proofs complexity in CPL, Logic Colloquium-, Muenster, Germany, 30, and the Bulletin of Symbolic Logic (in press), (2002)
  3. A. A. Chubaryan, H. G. Movsesyan, On the proofs complexity in intuitionistic and minimal propositional logic, Logic Colloquium-, Muenster, Germany, 45, and the Bulletin of Symbolic Logic (in press), (2002)
  4. A. A. Chubaryan, The Complexity in Frege Proofs with Substitution, Mathematical Problems of Computer Science, 22, pp. 7-11, (2001)
  5. A. A. Chubaryan, On the Complexity of proofs in a Frege system, Colloquium Logicum, Annals of the Kurt-Godel-Sosiety, v. 4, Vienna, 2001, 69, and the Bulletin of Symbolic Logic, v. 8, ?1, Murch 2002, 128, 4, (2001)
  6. A. A. Chubaryan, About the Complexity of proofs in Frege systems, CSIT Conference, Yerevan, pp. 129-132, (2001)
  7. A. A. Chubaryan, About some system of classical propositional calculus, Uchonie zapiski EGU, (in Russian), pp. 22-26, (2000)
  8. A. A. Chubaryan, Comparison of proofs size in Frege systems and substitution Frege systems, Izvestija NAN RA, 5, 35, (2000)
  9. H. Bolibekyan, A. A. Chubaryan, A Research of some complexities of proofs, (on Armenian Language), YSU, Collection of papers of the young scientists, Yerevan, (in Armenian), pp. 16-20, (2000)
  10. A. A. Chubaryan, The Powers of the essential subformulaes sets in Frege Proofs and substution Frege proofs, Mathematical Problems of Computer Science, 21, pp. 116-118, (2000)
  11. A. A. Chubaryan, About the lower bounds of proofs in Frege systems with substitutions, DNAH of Armenia, Applied Mathematics, 3, (in Russian), 100, pp. 223-227, (2000)
  12. A. A. Chubaryan, About complexity of proofs of separate classes of the formulas, CSIT Conference, Yerevan, pp. 7-8, (1999)
  13. A. A. Chubaryan, Complexity of deductions in a system of Classical propositional calculus, Izvestija NAN of Armenia, Mathematician, 34, 5, pp. 16-26, (1999)
  14. A. A. Chubaryan, On the lengths of deductions in several logical systems, CSIT Conference, Yerevan, (in Russian), pp. 37-38, (1997)
  15. A. A. Chubaryan, S. Y. Dalakyan, About some property of logic proofs, X All-Union Conference on Mathem. logic, Alma-Ata, p. 53, (in Russian), (1990)
  16. A. A. Chubaryan, A comparison of lengths of propositional proofs in some systems of calculus, IX All-Union Conference on Mathem. logic, Leningrad, p. 176, (in Russian), (1988)
  17. A. A. Chubaryan, About the performances of proofs in systems of predicate calculuses and of formal arithmetics, Mathematical problems cyberneticses and computer science", Yerevan, AN Arm. SSR, X, (in Russian), pp. 124-139, (1982)
  18. A. A. Chubaryan, About a comparison of lengths of proofs in various ystems of propositional calculuses, Second Chekhoslovensko-soviet seminar of young scientist on mathematical computer science, Bratislava, (in Russian), pp. 145-150, (1982)
  19. A. A. Chubaryan, About complexity of proofs in various systems propositional calculuses, Applied Mathematics, YSU, (in Russian), pp. 81-89, (1981)
  20. A. A. Chubaryan, About complexity of proofs in formal arithmetic and predicate calculus, DAN Arm. SSR, XIV, 4, (in Russian), pp. 193-196, (1977)
  21. G. S. Cejtin, A. A. Chubaryan, About some bounds of lengths of logic proofs in a classical propositional calculus, Mathematical problems of cybernetics and computer science ", Yerevan, AN Arm. SSR, (in Russian), pp. 57-64, (1975)
  22. A. A. Chubaryan, About some normal form and the performances of proofs in a classical propositional calculus, Izvestija AN Arm. SSR, X, 6, (in Russian), pp. 398-409, (1975)
  23. A. A. Chubaryan, On the lengths of proofs of the formulas in extensions formal arithmetics, Izvestia AN Arm. SSR, IX, 5, (in Russian), pp. 409-420, (1974)
  24. A. A. Chubaryan, About complexity of proofs of the formulas in extensions formal arithmetics, Molodoj Nauchnoj rabotnik", YSU, 2, (in Russian), (20), pp. 60-63, (1974)
  25. A. A. Chubaryan, About lengths of proofs of the formulas in extensions formal arithmetics, III All-Union conference on mathem. logic ( Thesises of the reports), Novosibirsk, (in Russian), pp. 225-226, (1974)
  26. A. A. Chubaryan, About some normal form and the performances of proofs in a classical propositional calculus, The theory of a logic proof (Thesises of the reports of an All-Union symposium), Part I, I. , (in Russian), pp. 87-88, (1974)
  27. G. S. Cejtin, A. A. Chubaryan, Some bounds of lengths of logic proofs In a classical propositional calculus, DAN Arm. SSR, (in Russian), 1, pp. 10-12, (1972)

Book

  1. Tonoyan R. N. , Chubaryan A. A., Automations and Turing's machines, Yerevan, YSU, (in Armenian), (1984)