Аксиоматизируемость и полнота некоторых классов -полигонов.
Algebra i Logika (1991)
- Volume: 30, Issue: 5, page 583-594
- ISSN: 0373-9252
Access Full Article
topHow to cite
topСтепанова, А.А.. "Аксиоматизируемость и полнота некоторых классов $S$-полигонов.." Algebra i Logika 30.5 (1991): 583-594. <http://eudml.org/doc/187584>.
@article{Степанова1991,
author = {Степанова, А.А.},
journal = {Algebra i Logika},
keywords = {monoid; flat $S$-polygons; projective $S$-polygons; free $S$-polygons; axiomatizability; completeness; model completeness; categoricity; ascending chain condition; ideals},
language = {rus},
number = {5},
pages = {583-594},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Аксиоматизируемость и полнота некоторых классов $S$-полигонов.},
url = {http://eudml.org/doc/187584},
volume = {30},
year = {1991},
}
TY - JOUR
AU - Степанова, А.А.
TI - Аксиоматизируемость и полнота некоторых классов $S$-полигонов.
JO - Algebra i Logika
PY - 1991
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 30
IS - 5
SP - 583
EP - 594
LA - rus
KW - monoid; flat $S$-polygons; projective $S$-polygons; free $S$-polygons; axiomatizability; completeness; model completeness; categoricity; ascending chain condition; ideals
UR - http://eudml.org/doc/187584
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.