Trees and ehrenfeucht-fraïssé games

DC Field	Value	Language
dc.contributor.author	Todorčević, Stevo	en
dc.contributor.author	Väänänen, Jouko	en
dc.date.accessioned	2020-05-01T20:29:28Z	-
dc.date.available	2020-05-01T20:29:28Z	-
dc.date.issued	1999-10-15	en
dc.identifier.issn	0168-0072	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2243	-
dc.description.abstract	Trees are natural generalizations of ordinals and this is especially apparent when one tries to find an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the usual ordering between ordinals. For example, one of the methods is the tree-analogue of the successor operation on the ordinals.	en
dc.publisher	Elsevier	-
dc.relation.ispartof	Annals of Pure and Applied Logic	en
dc.title	Trees and ehrenfeucht-fraïssé games	en
dc.type	Article	en
dc.identifier.doi	10.1016/S0168-0072(98)00064-5	en
dc.identifier.scopus	2-s2.0-0033569286	en
dc.relation.firstpage	69	en
dc.relation.lastpage	97	en
dc.relation.issue	1-3	en
dc.relation.volume	100	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.orcid	0000-0003-4543-7962	-

9

checked on Dec 26, 2024

25

checked on Dec 27, 2024

Check