This article is cited in 6 papers

Axiomatizability and completeness of some classes of partially ordered polygons

M. A. Pervukhin, A. A. Stepanova

Institute of Mathematics and Computer Sciences, Far Eastern National University, Vladivostok, 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.

Keywords: partially ordered monoid, class of partially ordered polygons, axiomatizable class, model complete class, complete class.

UDC: 510.67+512.56

Received: 31.01.2008

 English version: Algebra and Logic, 2009, 48:1, 54–71

Bibliographic databases:

• 
• 
• 
•