Geodesic
Axiomatizability and completeness of some classes of partially ordered polygons
Algebra i logika, Tome 48 (2009) no. 1, pp. 90-121

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{AL_2009_48_1_a3,
     author = {M. A. Pervukhin and A. A. Stepanova},
     title = {Axiomatizability and completeness of some classes of partially ordered polygons},
     journal = {Algebra i logika},
     pages = {90--121},
     publisher = {mathdoc},
     volume = {48},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2009_48_1_a3/}
}
TY  - JOUR
AU  - M. A. Pervukhin
AU  - A. A. Stepanova
TI  - Axiomatizability and completeness of some classes of partially ordered polygons
JO  - Algebra i logika
PY  - 2009
SP  - 90
EP  - 121
VL  - 48
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2009_48_1_a3/
LA  - ru
ID  - AL_2009_48_1_a3
ER  - 
%0 Journal Article
%A M. A. Pervukhin
%A A. A. Stepanova
%T Axiomatizability and completeness of some classes of partially ordered polygons
%J Algebra i logika
%D 2009
%P 90-121
%V 48
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2009_48_1_a3/
%G ru
%F AL_2009_48_1_a3
M. A. Pervukhin; A. A. Stepanova. Axiomatizability and completeness of some classes of partially ordered polygons. Algebra i logika, Tome 48 (2009) no. 1, pp. 90-121. http://geodesic.mathdoc.fr/item/AL_2009_48_1_a3/