|
This article is cited in 6 scientific papers (total in 6 papers)
Axiomatizability and completeness of some classes of partially ordered polygons
M. A. Pervukhin, A. A. Stepanova Institute of Mathematics and Computer Sciences, Far Eastern National University, Vladivostok, Russia
Abstract:
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.
Received: 31.01.2008
Citation:
M. A. Pervukhin, A. A. Stepanova, “Axiomatizability and completeness of some classes of partially ordered polygons”, Algebra Logika, 48:1 (2009), 90–121; Algebra and Logic, 48:1 (2009), 54–71
Linking options:
https://www.mathnet.ru/eng/al391 https://www.mathnet.ru/eng/al/v48/i1/p90
|
Statistics & downloads: |
Abstract page: | 461 | Full-text PDF : | 141 | References: | 101 | First page: | 8 |
|