DC FieldValueLanguage
dc.contributor.authorMoconja, Slavkoen
dc.contributor.authorTanović, Predragen
dc.date.accessioned2020-05-19T09:43:39Z-
dc.date.available2020-05-19T09:43:39Z-
dc.date.issued2015-01-01en
dc.identifier.issn0168-0072en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2754-
dc.description.abstractWe study asymmetric regular global types p∈S1(C). If p is regular and A-asymmetric then there exists a strict order such that Morley sequences in p over A are strictly increasing (we allow Morley sequences to be indexed by elements of a linear order). We prove that for any small model M ⊇ A maximal Morley sequences in p over A consisting of elements of M have the same (linear) order type, denoted by Invp, A(M). In the countable case we determine all possibilities for Invp, A(M): either it can be any countable linear order, or in any M ⊇ A it is a dense linear order (provided that it has at least two elements). Then we study relationship between Invp, A(M) and Invq, A(M) when p and q are strongly regular, A-asymmetric, and such that p⊇A and q⊇A are not weakly orthogonal. We distinguish two kinds of non-orthogonality: bounded and unbounded. In the bounded case we prove that Invp, A(M) and Invq, A(M) are either isomorphic or anti-isomorphic. In the unbounded case, Invp, A(M) and Invq, A(M) may have distinct cardinalities but we prove that their Dedekind completions are either isomorphic or anti-isomorphic. We provide examples of all four situations.en
dc.publisherElsevier-
dc.relationAlgebraic, logical and combinatorial methods with applications in theoretical computer science-
dc.relationRepresentations of logical structures and formal languages and their application in computing-
dc.relation.ispartofAnnals of Pure and Applied Logicen
dc.subjectComplete theory | Global type | Invariant type | Linear order | Morley sequence | Regular typeen
dc.titleAsymmetric regular typesen
dc.typeArticleen
dc.identifier.doi10.1016/j.apal.2014.09.003en
dc.identifier.scopus2-s2.0-84923078469en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage93en
dc.relation.lastpage120en
dc.relation.issue2en
dc.relation.volume166en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.project.funderNSF-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174026e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.fundingProgramDirectorate for Social, Behavioral & Economic Sciences-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740184-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Social, Behavioral & Economic Sciences/1740267-
crisitem.author.deptMathematics-
crisitem.author.orcid0000-0003-0307-7508-
Show simple item record

SCOPUSTM   
Citations

1
checked on Jun 1, 2024

Page view(s)

43
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.