Axiomatizability and completeness of some classes of partially ordered polygons

DOI10.1007/s10469-009-9040-6zbMath1241.03048OpenAlexW2111452509MaRDI QIDQ431672

M. A. Pervukhin, Alena Andreevna Stepanova

Publication date: 29 June 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-009-9040-6

zbMATH Keywords

partially ordered monoidaxiomatizable classclass of partially ordered polygonscomplete classmodel complete class

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Applications of model theory (03C98) Semigroups (20M99)

Related Items (3)

Axiomatizability of free \(S\)-posets ⋮ Axiomatisability problems for \(S\)-posets ⋮ Perfection for pomonoids

Cites Work

• Unnamed Item
• Axiomatizability and completeness of some classes of \(S\)-polygons
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Perfect monoids
• Perfect semigroups
• INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
• AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVES-ACTS
• Lazard's Theorem for S ‐posets
• Strongly Flat andPO-FlatS-Posets
• Axiomatisability Problems for S -Systems

This page was built for publication: Axiomatizability and completeness of some classes of partially ordered polygons