DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tanović, Predrag | en_US |
dc.contributor.author | Moconja, Slavko | en_US |
dc.contributor.author | Ilić, Dejan | en_US |
dc.date.accessioned | 2020-12-08T09:56:13Z | - |
dc.date.available | 2020-12-08T09:56:13Z | - |
dc.date.issued | 2020-10-27 | - |
dc.identifier.issn | 0022-4812 | - |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/4279 | - |
dc.description.abstract | Let M= (M,<,...) be a linearly ordered first-order structure and T its complete theory. We investigate conditions for T that could guarantee that M is not much more complex than some colored orders (linear orders with added unary predicates). Motivated by Rubin’s work [5], we label three conditions expressing properties of types of T and/or automorphisms of models of T. We prove several results which indicate the “geometric” simplicity of definable sets in models of theories satisfying these conditions. For example, we prove that the strongest condition characterizes, up to definitional equivalence (inter-definability), theories of colored orders expanded by equivalence relations with convex classes | en_US |
dc.publisher | Cambridge University Press | en_US |
dc.relation.ispartof | The Journal of Symbolic Logic | en_US |
dc.title | AROUND RUBIN’S “THEORIES OF LINEAR ORDER” | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1017/jsl.2020.68 | - |
dc.identifier.scopus | 2-s2.0-85104269009 | - |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 1403 | - |
dc.relation.lastpage | 1426 | - |
dc.relation.issue | 4 | - |
dc.relation.volume | 85 | - |
dc.description.rank | M22 | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Mathematics | - |
crisitem.author.orcid | 0000-0003-0307-7508 | - |
SCOPUSTM
Citations
1
checked on Jun 1, 2024
Page view(s)
68
checked on May 9, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.