Axiomatizability and completeness of some classes of partially ordered polygons
From MaRDI portal
Publication:431672
DOI10.1007/S10469-009-9040-6zbMATH Open1241.03048OpenAlexW2111452509MaRDI QIDQ431672FDOQ431672
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
Recommendations
complete classaxiomatizable classclass of partially ordered polygonsmodel complete classpartially ordered monoid
Cites Work
- Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
- INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
- Title not available (Why is that?)
- Lazard's Theorem for S ‐posets
- Strongly Flat andPO-FlatS-Posets
- Perfect monoids
- Perfect semigroups
- Axiomatizability and completeness of some classes of \(S\)-polygons
- AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVES-ACTS
- Axiomatisability Problems for S -Systems
Cited In (5)
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)