{"id":"https://openalex.org/W4284888488","doi":"https://doi.org/10.1017/s1755020322000247","title":"COUNTING TO INFINITY: GRADED MODAL LOGIC WITH AN INFINITY DIAMOND","display_name":"COUNTING TO INFINITY: GRADED MODAL LOGIC WITH AN INFINITY DIAMOND","publication_year":2022,"publication_date":"2022-07-07","ids":{"openalex":"https://openalex.org/W4284888488","doi":"https://doi.org/10.1017/s1755020322000247"},"language":"en","primary_location":{"id":"doi:10.1017/s1755020322000247","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1755020322000247","pdf_url":null,"source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"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":"The Review of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.uva.nl/ws/files/178706957/counting-to-infinity-graded-modal-logic-with-an-infinity-diamond.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022076150","display_name":"Ignacio Bellas Acosta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"IGNACIO BELLAS ACOSTA","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5105920523","display_name":"Yde Venema","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"YDE VENEMA","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05687951,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9936000108718872,"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/decidability","display_name":"Decidability","score":0.7644774913787842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7006744146347046},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.6221282482147217},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.5300785303115845},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4946849048137665},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4846511483192444},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.45825186371803284},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.4465814530849457},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4388159513473511},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.39403653144836426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3697861433029175},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1090330183506012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10706636309623718}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7644774913787842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7006744146347046},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.6221282482147217},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.5300785303115845},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4946849048137665},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4846511483192444},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.45825186371803284},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.4465814530849457},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4388159513473511},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.39403653144836426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3697861433029175},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1090330183506012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10706636309623718},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1755020322000247","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1755020322000247","pdf_url":null,"source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"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":"The Review of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire/184894bb-d052-49de-ae09-b205c595832c","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/counting-to-infinity-graded-modal-logic-with-an-infinity-diamond(184894bb-d052-49de-ae09-b205c595832c).html","pdf_url":"https://pure.uva.nl/ws/files/178706957/counting-to-infinity-graded-modal-logic-with-an-infinity-diamond.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bellas Acosta, I & Venema, Y 2024, 'Counting to infinity: Graded modal logic with an infinity diamond', Review of Symbolic Logic, vol. 17, no. 1, pp. 1-35. https://doi.org/10.1017/S1755020322000247","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dare.uva.nl:publications/184894bb-d052-49de-ae09-b205c595832c","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/184894bb-d052-49de-ae09-b205c595832c","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bellas Acosta, I & Venema, Y 2024, 'Counting to infinity: Graded modal logic with an infinity diamond', Review of Symbolic Logic, vol. 17, no. 1, pp. 1-35. https://doi.org/10.1017/S1755020322000247","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire/184894bb-d052-49de-ae09-b205c595832c","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/counting-to-infinity-graded-modal-logic-with-an-infinity-diamond(184894bb-d052-49de-ae09-b205c595832c).html","pdf_url":"https://pure.uva.nl/ws/files/178706957/counting-to-infinity-graded-modal-logic-with-an-infinity-diamond.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bellas Acosta, I & Venema, Y 2024, 'Counting to infinity: Graded modal logic with an infinity diamond', Review of Symbolic Logic, vol. 17, no. 1, pp. 1-35. https://doi.org/10.1017/S1755020322000247","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4284888488.pdf","grobid_xml":"https://content.openalex.org/works/W4284888488.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W7516668","https://openalex.org/W251225716","https://openalex.org/W1483655485","https://openalex.org/W1534803797","https://openalex.org/W1636976386","https://openalex.org/W1778829768","https://openalex.org/W2004306067","https://openalex.org/W2027044995","https://openalex.org/W2049069994","https://openalex.org/W2068606630","https://openalex.org/W2086035610","https://openalex.org/W2088189323","https://openalex.org/W2106262891","https://openalex.org/W2108446683","https://openalex.org/W2167608641","https://openalex.org/W2176114185","https://openalex.org/W2911599249","https://openalex.org/W2954301182","https://openalex.org/W2977638645","https://openalex.org/W3211223274","https://openalex.org/W4211144022","https://openalex.org/W4230936490","https://openalex.org/W4247534169","https://openalex.org/W4254216090","https://openalex.org/W6782386224"],"related_works":["https://openalex.org/W2294297515","https://openalex.org/W4290930689","https://openalex.org/W3093966545","https://openalex.org/W2585890227","https://openalex.org/W1543051890","https://openalex.org/W3217105492","https://openalex.org/W2072122432","https://openalex.org/W2789140669","https://openalex.org/W2166108892","https://openalex.org/W2429430572"],"abstract_inverted_index":{"Abstract":[0],"We":[1,56],"extend":[2],"the":[3,13,20,41,62,66,72,78,99,130],"languages":[4],"of":[5,22,38,65,74,101,122,129],"both":[6,31,83],"basic":[7],"and":[8,50,87,95,125],"graded":[9],"modal":[10],"logic":[11,76],"with":[12,77,116],"infinity":[14,79],"diamond,":[15],"a":[16,27,35,93,112,119],"modality":[17],"that":[18,44,103],"expresses":[19],"existence":[21],"infinitely":[23],"many":[24],"successors":[25],"having":[26],"certain":[28],"property.":[29],"In":[30],"cases":[32],"we":[33,45,91,110,126],"define":[34],"natural":[36],"notion":[37],"bisimilarity":[39],"for":[40,82,98],"resulting":[42],"formalisms,":[43],"dub":[46],"$\\mathtt":[47,51,84,88],"{ML}^{\\infty":[48,85],"}$":[49,53,86,90],"{GML}^{\\infty":[52,89],",":[54],"respectively.":[55],"then":[57],"characterise":[58],"these":[59],"logics":[60],"as":[61],"bisimulation-invariant":[63],"fragments":[64],"naturally":[67],"corresponding":[68],"predicate":[69],"logic,":[70],"viz.,":[71],"extension":[73],"first-order":[75],"quantifier.":[80],"Furthermore,":[81],"provide":[92],"sound":[94],"complete":[96],"axiomatisation":[97],"set":[100],"formulas":[102],"are":[104],"valid":[105],"in":[106],"every":[107],"Kripke":[108],"frame,":[109],"prove":[111],"small":[113],"model":[114],"property":[115],"respect":[117],"to":[118],"widened":[120],"class":[121],"weighted":[123],"models,":[124],"establish":[127],"decidability":[128],"satisfiability":[131],"problem.":[132]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}