Computing and dominating the Ryll-Nardzewski function

U. Andrews^a, A. M. Kach<sup>b

a</sup> Department of Mathematics, University of Wisconsin, Madison, WI, 53706-1388, USA
^b Department of Mathematics, University of Chicago, Chicago, IL, USA

Abstract: 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.

UDC: 510.67

Received: 20.03.2013

 English version: Algebra and Logic, 2014, 53:2, 176–183

Bibliographic databases:

• 
• 
•