Show simple item record

dc.contributor.authorMwesigye, F.
dc.contributor.authorTruss, J. K.
dc.date.accessioned2021-05-04T12:06:29Z
dc.date.available2021-05-04T12:06:29Z
dc.date.issued2019-05-02
dc.identifier.citationMwesigye, F., & Truss, J. K. (2019). On optimal representatives of finite coloured linear orders. Order, 36(1), 107-117.en_US
dc.identifier.urihttp://ir.must.ac.ug/xmlui/handle/123456789/759
dc.description.abstractTwo structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeucht-Fra¨ıss´e game on A and B. We extend earlier results about equivalence classes for finite colored linear orders, describing an algorithm for reducing to canonical form under 2-equivalence, and concentrating on the cases of 2 and 3 movesen_US
dc.language.isoen_USen_US
dc.publisherOrderen_US
dc.subjectColoured linear orderen_US
dc.subjectEhrenfeucht-Fra¨ıss´e gameen_US
dc.subjectOptimalityen_US
dc.subjectClassificationen_US
dc.titleOn Optimal Representatives of Finite Coloured Linear Ordersen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record