Geodesic
Computing and dominating the Ryll-Nardzewski function
Algebra i logika, Tome 53 (2014) no. 2, pp. 271-281

Voir la notice de l'article provenant de la source Math-Net.Ru

For a countably categorical theory $\mathrm T$, we study the complexity of computing and the complexity of dominating the function specifying the number of $n$-types consistent with $\mathrm T$.
Keywords: countably categorical theory, Ryll-Nardzewski function, complexity of function. 
@article{AL_2014_53_2_a7,
     author = {U. Andrews and A. M. Kach},
     title = {Computing and dominating the {Ryll-Nardzewski} function},
     journal = {Algebra i logika},
     pages = {271--281},
     publisher = {mathdoc},
     volume = {53},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2014_53_2_a7/}
}
TY  - JOUR
AU  - U. Andrews
AU  - A. M. Kach
TI  - Computing and dominating the Ryll-Nardzewski function
JO  - Algebra i logika
PY  - 2014
SP  - 271
EP  - 281
VL  - 53
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2014_53_2_a7/
LA  - ru
ID  - AL_2014_53_2_a7
ER  - 
%0 Journal Article
%A U. Andrews
%A A. M. Kach
%T Computing and dominating the Ryll-Nardzewski function
%J Algebra i logika
%D 2014
%P 271-281
%V 53
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2014_53_2_a7/
%G ru
%F AL_2014_53_2_a7
U. Andrews; A. M. Kach. Computing and dominating the Ryll-Nardzewski function. Algebra i logika, Tome 53 (2014) no. 2, pp. 271-281. http://geodesic.mathdoc.fr/item/AL_2014_53_2_a7/