On the number of countable models of stable theories

DC Field	Value	Language
dc.contributor.author	Tanović, Predrag	en
dc.date.accessioned	2020-05-19T09:43:40Z	-
dc.date.available	2020-05-19T09:43:40Z	-
dc.date.issued	2001-01-01	en
dc.identifier.issn	0016-2736	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2769	-
dc.description.abstract	We prove: THEOREM. If T is a countable, complete, stable, first-order theory having an infinite set of constants with different interpretations, then I(T,N0) ≥ N0.	en
dc.publisher	Instytut Matematyczny Polskiej Akademii Nauk	-
dc.relation.ispartof	Fundamenta Mathematicae	en
dc.title	On the number of countable models of stable theories	en
dc.type	Article	en
dc.identifier.doi	10.4064/fm169-2-3	en
dc.identifier.scopus	2-s2.0-0039248541	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	139	en
dc.relation.lastpage	144	en
dc.relation.issue	2	en
dc.relation.volume	169	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
crisitem.author.dept	Mathematics	-
crisitem.author.orcid	0000-0003-0307-7508	-

3

checked on Dec 20, 2024

16

checked on Dec 22, 2024

Check