Бирешетки

Authors

  • Institute for Informatics and Automation Problems of NAS RA

Abstract

  

References

M.L. Ginsberg, Multi-valued logics: a uniform approach to reasoning in artificial intelligence, Computational Intelligence 4(1988), 265-316.

M.C. Fitting, Bilattices in logic programming, in: G. Epstain ed., proc 20-th Internat. Symp. on Multiple-Valued Logic, IEEE, New-York, 1990, 63-70.

M.C. Fitting, Logic programming on a topological bilattice, Found. Inform. 11(1988), 209- 218

M.C. Fitting, Bilattices and semantics of logic programming, Journal of Logic Programming, 11(1991), 91-116.

B. Jonsson, Distributive Bilattices, Vanderbilt University.

B. Mobasher, D. Pigozzi, G. Slutzki, Multi-valued Logic Programming Semantics: An Algebraic Approach, Teoretical Computer Science, 171(1997), 77-109,

B. Mobasher, D.Pigozzi, G. Slutzki, G. Voutsadakis, A Duality Theory for Bilattices, Algebra Univers., 43(2000), 109-125.

A.B. Romanowska, A. Trakul, On the structure of some bilattices, Universal and Applied Algebra, World Scientific, 1989, 235-253.

A. Avron, The structure of interlaced bilattices, Math. Struct. In Comp. Science, Cambridge University Press, 6(1996), 287-299.

Yu.M. Movsisyan, A.B. Romanowska, J.D.H. Smith., Superproducts, hyperidentities, and algebraic structures of logic programming, Comb. Math. And. Comb. Comp., 58(2006), 101-111.

Yu.M. Movsisyan, Interlaced, modular, distributive and Boolean bilattices, Armenian Journal of Mathematics, 1, 7-13, 2008.

Ю.М. Мовсисян, Введение в теорию алгебр со сверхтождествами, Изд-во Ереванского Госуниверситета, 1986.

Ю.М. Мовсисян, Сверхтождества в алгрбрах и многообразиях, УМН, 1998, т.53, N1(319), 61-114.

Ю.М. Мовсисян, Алгебры со сверхтождествами многообразия булевых алгебр, Изв. РАН. Сер. матем. 1996, т.60, N6, 127-168.

Ю.М. Мовсисян, Сверхтождества булевых алгебр, Изв. РАН. Сер. матем. 1992, т.56, N3, 654-672.

Yu.Movsisyan, Hyperidentities and hypervarieties, Scientiae Mathematicae Japonicae, 54,3(2001,595-640.

R. Padmanabhan, P. Penner, Binary hyperidentities of lattices, Aequations Math., 1992, V.44, 154-167.

R. Padmanabhan, P. Penner, A hyperbase for Binary Lattice Hyperidentities, Journal of Automated Reasoning, 24(2000), 365-370.

K. Denecke and Sh.L.Wismath, Hyperidentities and Clones, Gordon and Breach Science Publishers, 2000.

J. Koppitz and K. Denecke, M-Solid Varieties of Algebras, Springer, 2006.

В.Д. Аносов, О гомоморфизмах многоосновных алгебраических систем в связи с криптографическими применениями, Дискретная математика, 2007, т.19, N2, 27-44.

J.M. Font, M.Moussavi, Notes on a six-valued extension of tree-valued logic, Jour. of Applied Non-Classical Logic, vol. 3(1993), 173-187.

M. Kondo, On the structures of weak interlaced bilattices, In 32nd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2002), May 15-18, 2002, Boston, Massachusetts, USA, pages 23, IEEE Computer Society, 2002.

Г. Гретцер, Общая теория решеток, М., “ Мир”, 1982.

Yu.M. Movsisyan, L.M. Budaghyan, The Elementary characterization of algebras with hyperidentities of Boolean algebras, Intrnational conference Mathematical Logic, Algebra and Set Theory dedicated to the 100-th anniversary of P.S. Novikov, August 27-31, 2001, Moscow 2001, p. 32.

Yu.M. Movsisyan, L.M. Budaghyan, On elementary decidability of quasi-Boolean algebras, Intrnational Conference Mathematics in Armenia, Advanced and Perspectives, September 30-October 7, 2003, Yerevan, Armenia, p. 55-57.

Б.И. Плоткин, Универсальная алгебра, алгебраическая логика и базы данных, М., Наука, 1991.

Downloads

Published

2021-12-10

How to Cite

Ю. М. (2021). Бирешетки. Mathematical Problems of Computer Science, 34, 43–44. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/320