DC FieldValueLanguage
dc.contributor.authorDi Prisco, Carlosen
dc.contributor.authorTodorčević, Stevoen
dc.date.accessioned2020-05-01T20:29:23Z-
dc.date.available2020-05-01T20:29:23Z-
dc.date.issued2014-04-01en
dc.identifier.issn0236-5294en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2191-
dc.description.abstractWe address several questions related to the Ramsey degree of the class of infinite structures isomorphic to the positive integers with the usual ordering. In particular we study the strength of stating that this class has finite Ramsey degree in the absence of the axiom of choice. We show that if the shift graph has finite chromatic number then this class has infinite Ramsey degree.en
dc.publisherSpringer Link-
dc.relation.ispartofActa Mathematica Hungaricaen
dc.subject03E02 | 03E05 | non-meager filter | partition relation | Ramsey degree | shift graphen
dc.titleThe shift graph and the Ramsey degree of ℕ ωen
dc.typeArticleen
dc.identifier.doi10.1007/s10474-013-0349-1en
dc.identifier.scopus2-s2.0-84893933122en
dc.relation.firstpage484en
dc.relation.lastpage493en
dc.relation.issue2en
dc.relation.volume142en
dc.description.rankM23-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-4543-7962-
Show simple item record

Page view(s)

42
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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