Teaching Undergraduate: Introduction to Information Science; Foundation of Computers;
Discrete Mathematics for Computer Science; Graphs and Algorithms; Theory of Computation II; Advanced Seminar in Computer Science II
Postgraduate: Advanced Studies in Mathematical Science I; Advanced Studies in Analysis and Topology

Research Field
General field – Discrete Mathematics and Theoretical Computer Science
Specific topics – Multiple-Valued Logic, Decomposition of Logic Functions,
Clone Theory and Universal Algebra, Optimization and Enumeration Problems

Example Publications 1. G.Pogosyan, A.Nozaki
"Completeness and Closed Classes of Boolean Functions under
Compositions with Feedback Loops,"
Multiple Valued Logic. An International Journal, 1996, Vol.1,
pp.285-306, Gordon and Breach Scientific Publishers
2. G.Pogosyan, M.Miyakawa, A.Nozaki, I.G.Rosenberg
"On the Number of Clique Boolean Functions,"
IEICE Transactions on Fundamentals of Electronics, Communications and
Computer Science, 1997, Vol. E80-A, No.8, pp. 1502-1507
3. G.Pogosyan
"The Number of Cascade Functions",
Proceedings, 29th International Symposium on Multiple Valued Logic,
May 1999, pp. 251-256, IEEE Press
4. G. Pogosyan:
“Classes of Boolean Functions Defined by Functional Terms”
Multiple Valued Logic and Soft Computing; Vol. 7, pp. 417-448
(2001), Old City Publishers
5. Grant R. Pogosyan and Ivo G. Rosenberg:
“Generation of the Post Lattice by Irreducible Clones,”
Proceedings of the 33rd International Symposium on Multiple Valued Logic,
May 2003, pp. 309-315, IEEE Press