๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Countable categoricity

โœ Scribed by K. Zh. Kudaibergenov

Book ID
105425377
Publisher
Springer US
Year
1988
Tongue
English
Weight
158 KB
Volume
27
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Countably categorical theories
Countably categorical theories
โœ V. G. Puzarenko ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Springer US ๐ŸŒ English โš– 932 KB
The complexity of countable categoricity
The complexity of countable categoricity in finite languages
โœ Aleksander Ivanov ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 139 KB

## Abstract We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.

Countably categorical coloured linear or
Countably categorical coloured linear orders
โœ Feresiano Mwesigye; John K. Truss ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 107 KB

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