首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Cancellation in Skew Lattices
Authors:Karin Cvetko-Vah  Michael Kinyon  Jonathan Leech  Matthew Spinks
Institution:(1) Department of Mathematics, Shahid Bahonar University of Kerman, Kerman, Iran;(2) Department of Information Technology, College of Applied Sciences, Post Box:135, Sohar, 311, Sultanate of Oman;(3) Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran
Abstract:Distributive lattices are well known to be precisely those lattices that possess cancellation: x úy = x úzx \lor y = x \lor z and x ùy = x ùzx \land y = x \land z imply y = z. Cancellation, in turn, occurs whenever a lattice has neither of the five-element lattices M 3 or N 5 as sublattices. In this paper we examine cancellation in skew lattices, where the involved objects are in many ways lattice-like, but the operations ù\land and ú\lor no longer need be commutative. In particular, we find necessary and sufficient conditions involving the nonoccurrence of potential sub-objects similar to M 3 or N 5 that ensure that a skew lattice is left cancellative (satisfying the above implication) right cancellative (x úz = y úzx \lor z = y \lor z and x ùz = y ùzx \land z = y \land z imply x = y) or just cancellative (satisfying both implications). We also present systems of identities showing that left right or fully] cancellative skew lattices form varieties. Finally, we give some positive characterizations of cancellation.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号