Axiomatizability and completeness of some classes of partially ordered polygons

DOI10.1007/S10469-009-9040-6MaRDI QIDQ431672zbMATH OpenOpenAlexFDO

Authors 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

complete classaxiomatizable classclass of partially ordered polygonsmodel complete classpartially ordered monoid

Mathematics Subject Classification ID

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

Recommendations

• Axiomatizability and completeness of some classes of \(S\)-polygons
• scientific article; zbMATH DE number 2203308
• On regular partially ordered polygons
• Axiomatizability of free \(S\)-posets
• scientific article; zbMATH DE number 2007872

Cites work

• scientific article; zbMATH DE number 3297895 (Why is no real title available?)
• AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVES-ACTS
• Axiomatisability Problems for S -Systems
• Axiomatizability and completeness of some classes of \(S\)-polygons
• INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
• Lazard's Theorem for S ‐posets
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Perfect monoids
• Perfect semigroups
• Strongly Flat andPO-FlatS-Posets

Cited in

(5)

• Axiomatisability problems for \(S\)-posets
• Perfection for pomonoids
• Axiomatizability of free \(S\)-posets
• Axiomatizability and completeness of some classes of \(S\)-polygons
• On regular partially ordered polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431672)