<title-group xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><article-title xml:lang="en"><math><mi>M</mi></math>-completeness is seldom monadic over graphs.</article-title></title-group>

Adámek, Jiří; Kelly, G.M.

M-completeness is seldom monadic over graphs.

Theory and Applications of Categories [electronic only], Tome 7 (2000), p. 171-205 / Harvested from The Electronic Library of Mathematics

Access to full text
Full (PDF)

Publié le : 2000-01-01

Zbl 0956.18001

EUDML-ID : urn:eudml:doc:120813

@article{01467484,
     title = {<title-group xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><article-title xml:lang="en"><math><mi>M</mi></math>-completeness is seldom monadic over graphs.</article-title></title-group>},
     journal = {Theory and Applications of Categories [electronic only]},
     volume = {7},
     year = {2000},
     pages = {171-205},
     zbl = {0956.18001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01467484}
}

Adámek, Jiří; Kelly, G.M.  $M$ -completeness is seldom monadic over graphs.. Theory and Applications of Categories [electronic only], Tome 7 (2000) pp. 171-205. http://gdmltest.u-ga.fr/item/01467484/