In this paper, we give a classification of (finite or countable) β΅0-categorical coloured linear orders, generalizing Rosenstein's characterization of β΅0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and Qn-combinations (for n β₯ 1). We give
β¦ LIBER β¦
Colour associates to semantic linear orders
β Scribed by Benny Shanon
- Publisher
- Guilford Publishing Inc
- Year
- 1982
- Tongue
- English
- Weight
- 472 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0340-0727
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Countably categorical coloured linear or
β
Feresiano Mwesigye; John K. Truss
π
Article
π
2010
π
John Wiley and Sons
π
English
β 107 KB
Classification of Finite Coloured Linear
β
Feresiano Mwesigye; John Kenneth Truss
π
Article
π
2010
π
Springer Netherlands
π
English
β 281 KB
Extending partial orders to dense linear
β
Theodore A. Slaman; W.Hugh Woodin
π
Article
π
1998
π
Elsevier Science
π
English
β 652 KB
Unified linear subspace approach to sema
β
Dandan Li; Chung-Ping Kwong; Dik Lun Lee
π
Article
π
2009
π
John Wiley and Sons
π
English
β 847 KB
A Semantic Approach to Order-sorted Rewr
β
A. Werner
π
Article
π
1998
π
Elsevier Science
π
English
β 863 KB
Order-sorted rewriting builds a nice framework to handle partially defined functions and subtypes. To be able to prove a critical-pair lemma and Birkhoff's completeness theorem, order-sorted rewriting was restricted to sort decreasing term rewriting systems. However, natural examples show that this
A semantic approach to optimize linear d
β
JosΓ© R. ParamΓ‘; Nieves R. Brisaboa; Miguel R. Penabad; Γngeles S. Places
π
Article
π
2006
π
Springer-Verlag
π
English
β 945 KB