DC FieldValueLanguage
dc.contributor.authorMoconja, Slavkoen_US
dc.contributor.authorTanović, Predragen_US
dc.date.accessioned2021-07-14T11:00:56Z-
dc.date.available2021-07-14T11:00:56Z-
dc.date.issued2021-05-29-
dc.identifier.issn0933-5846-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4617-
dc.description.abstractWe present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also prove that weak quasi-o-minimality of a theory with respect to one definable linear order implies weak quasi-o-minimality with respect to any other such order.en_US
dc.publisherSpringer Linken_US
dc.relation.ispartofArchive for Mathematical Logicen_US
dc.subjectBinary reduct | Definable linear orders | Linearly ordered structures | Weak quasi-o-minimalityen_US
dc.titleDoes weak quasi-o-minimality behave better than weak o-minimality?en_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s00153-021-00778-3-
dc.identifier.scopus2-s2.0-85107304382-
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.description.rank~M22-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.deptMathematics-
crisitem.author.orcid0000-0003-0307-7508-
Show simple item record

Page view(s)

63
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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