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


Axiomatizability and completeness of some classes of partially ordered polygons
Authors:M. A. Pervukhin  A. A. Stepanova
Affiliation:(1) Far Eastern National University, ul. Sukhanova 8, Vladivostok, 690600, Russia;(2) Far Eastern National University, ul. Sukhanova 8, Vladivostok, 690600, Russia
Abstract:We study partially ordered monoids over which a class of free (over sets and over posets), projective, and (strongly, weakly) flat partially ordered polygons is axiomatizable, complete, or model complete. Similar issues for polygons were dealt with in papers by V. Gould and A. Stepanova. Supported by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (grant NSh-2810.2008.1). Translated from Algebra i Logika, Vol. 48, No. 1, pp. 90–121, January–February, 2009.
Keywords:partially ordered monoid  class of partially ordered polygons  axiomatizable class  model complete class  complete class
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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