{"id":"https://openalex.org/W2238496257","doi":"https://doi.org/10.1017/s0960129518000397","title":"Characterizing polynomial Ramsey quantifiers","display_name":"Characterizing polynomial Ramsey quantifiers","publication_year":2019,"publication_date":"2019-02-28","ids":{"openalex":"https://openalex.org/W2238496257","doi":"https://doi.org/10.1017/s0960129518000397","mag":"2238496257"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129518000397","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129518000397","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1601.02258","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068702258","display_name":"Ronald de Haan","orcid":"https://orcid.org/0000-0003-2023-0586"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ronald de Haan","raw_affiliation_strings":["Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054882691","display_name":"Jakub Szymanik","orcid":"https://orcid.org/0000-0002-6145-6322"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jakub Szymanik","raw_affiliation_strings":["Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054882691"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00153168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"06","first_page":"896","last_page":"908"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.6282597780227661},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5513513088226318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5409923195838928},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5134833455085754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4469109773635864},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4378073215484619},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4367644488811493},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4337816536426544},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.41586342453956604},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4142739176750183},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3914661407470703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3245964050292969},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24961867928504944},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13208267092704773},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06823143362998962}],"concepts":[{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.6282597780227661},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5513513088226318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5409923195838928},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5134833455085754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4469109773635864},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4378073215484619},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4367644488811493},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4337816536426544},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.41586342453956604},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4142739176750183},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3914661407470703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3245964050292969},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24961867928504944},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13208267092704773},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06823143362998962},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s0960129518000397","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129518000397","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/84a3a5bd-1766-4efd-af34-1b2267edc34b","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/characterizing-polynomial-ramsey-quantifiers(84a3a5bd-1766-4efd-af34-1b2267edc34b).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Haan, R & Szymanik, J 2019, 'Characterizing polynomial Ramsey quantifiers', Mathematical Structures in Computer Science, vol. 29, no. 6, pp. 896-908. https://doi.org/10.1017/S0960129518000397","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:1601.02258","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1601.02258","pdf_url":"https://arxiv.org/pdf/1601.02258","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:iris.unitn.it:11572/364232","is_oa":false,"landing_page_url":"https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/abs/characterizing-polynomial-ramsey-quantifiers/0B1DF61C95EBDCC766C1670101B21D41","pdf_url":null,"source":{"id":"https://openalex.org/S4377196320","display_name":"Iris (University of Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/84a3a5bd-1766-4efd-af34-1b2267edc34b","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/characterizing-polynomial-ramsey-quantifiers(84a3a5bd-1766-4efd-af34-1b2267edc34b).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Structures in Computer Science, 29(6), 896 - 908. Cambridge University Press","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1601.02258","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1601.02258","pdf_url":"https://arxiv.org/pdf/1601.02258","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W39085972","https://openalex.org/W93404625","https://openalex.org/W987035227","https://openalex.org/W1481656063","https://openalex.org/W1489148631","https://openalex.org/W1516197069","https://openalex.org/W1527197079","https://openalex.org/W1570425181","https://openalex.org/W1699142814","https://openalex.org/W1894586384","https://openalex.org/W1985572324","https://openalex.org/W1986360923","https://openalex.org/W1988735961","https://openalex.org/W1991317290","https://openalex.org/W2009147258","https://openalex.org/W2052936500","https://openalex.org/W2062172380","https://openalex.org/W2089224266","https://openalex.org/W2095689360","https://openalex.org/W2123165340","https://openalex.org/W2130190334","https://openalex.org/W2134900828","https://openalex.org/W2166566648","https://openalex.org/W2171491461","https://openalex.org/W2249739104","https://openalex.org/W2412947200","https://openalex.org/W2475732641","https://openalex.org/W2490706771","https://openalex.org/W2591588033","https://openalex.org/W2911599249","https://openalex.org/W4251501660","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W4233928060","https://openalex.org/W2295040078","https://openalex.org/W2086025566","https://openalex.org/W1702487489","https://openalex.org/W2132910148","https://openalex.org/W2042051386","https://openalex.org/W270168689","https://openalex.org/W2019192060","https://openalex.org/W3003471035","https://openalex.org/W2625390511"],"abstract_inverted_index":{"Abstract":[0],"Ramsey":[1,37,68,84,109],"quantifiers":[2,38,69,101],"are":[3,39,105],"a":[4,50,74,78,88],"natural":[5,23,33,51,81],"object":[6],"of":[7,22,53,83],"study":[8],"not":[9],"only":[10],"for":[11,18,77],"logic":[12],"and":[13,45,70,80,90],"computer":[14],"science":[15],"but":[16],"also":[17],"the":[19,32,54,98,107],"formal":[20],"semantics":[21],"language.":[24],"Restricting":[25],"attention":[26],"to":[27,31],"finite":[28],"models":[29],"leads":[30],"question":[34],"whether":[35,46],"all":[36],"either":[40],"polynomial-time":[41,55,99],"computable":[42,56,100],"or":[43],"NP-hard,":[44],"we":[47,61,72],"can":[48],"give":[49],"characterization":[52],"quantifiers.":[57,110],"In":[58],"this":[59,103],"paper,":[60],"first":[62],"show":[63,96],"that":[64,97],"there":[65],"exist":[66],"intermediate":[67],"then":[71],"prove":[73],"dichotomy":[75],"result":[76],"large":[79],"class":[82,104],"quantifiers,":[85],"based":[86],"on":[87],"reasonable":[89],"widely":[91],"believed":[92],"complexity":[93],"assumption.":[94],"We":[95],"in":[102],"exactly":[106],"constant-log-bounded":[108]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2020-11-23T00:00:00"}