Axiomatizability and completeness of some classes of partially ordered polygons

• Autores: M. A. Pervukhin, A. A. Stepanova
• Localización: Algebra and logic, ISSN 0002-5232, Vol. 48, Nº. 1, 2009, págs. 54-71
• Idioma: inglés
• DOI: 10.1007/s10469-009-9040-6
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.