{"id":"https://openalex.org/W2147756013","doi":"https://doi.org/10.1017/s1755020310000389","title":"THE EXPRESSIVE POWER OF MEMORY LOGICS","display_name":"THE EXPRESSIVE POWER OF MEMORY LOGICS","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2147756013","doi":"https://doi.org/10.1017/s1755020310000389","mag":"2147756013"},"language":"en","primary_location":{"id":"doi:10.1017/s1755020310000389","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020310000389","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/021B058177CA9738B490C1F373D12CA2/S1755020310000389a.pdf/div-class-title-the-expressive-power-of-memory-logics-div.pdf","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":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/021B058177CA9738B490C1F373D12CA2/S1755020310000389a.pdf/div-class-title-the-expressive-power-of-memory-logics-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022706489","display_name":"Carlos Areces","orcid":"https://orcid.org/0000-0001-7845-8503"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210127166","display_name":"Centre Inria de l'Universit\u00e9 de Lorraine","ror":"https://ror.org/03fcjvn64","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"CARLOS ARECES","raw_affiliation_strings":["INRIA Nancy Grand Est"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Nancy Grand Est","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002674443","display_name":"Diego Figueira","orcid":"https://orcid.org/0000-0003-0114-2257"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"DIEGO FIGUEIRA","raw_affiliation_strings":["INRIA Saclay, ENS Cachan, LSV"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Saclay, ENS Cachan, LSV","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082992052","display_name":"Santiago Figueira","orcid":"https://orcid.org/0000-0002-8055-397X"},"institutions":[{"id":"https://openalex.org/I151201029","display_name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","ror":"https://ror.org/03cqe8w59","country_code":"AR","type":"government","lineage":["https://openalex.org/I151201029","https://openalex.org/I4210123736","https://openalex.org/I4387155568"]}],"countries":["AR"],"is_corresponding":true,"raw_author_name":"SANTIAGO FIGUEIRA","raw_affiliation_strings":["Departamento de Computaci\u00f3n, FCEyN, UBA and CONICET"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computaci\u00f3n, FCEyN, UBA and CONICET","institution_ids":["https://openalex.org/I151201029"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056368365","display_name":"Sergio Mera","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"SERGIO MERA","raw_affiliation_strings":["Departamento de Computaci\u00f3n, FCEyN, UBA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computaci\u00f3n, FCEyN, UBA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5002674443","https://openalex.org/A5022706489","https://openalex.org/A5056368365","https://openalex.org/A5082992052"],"corresponding_institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283","https://openalex.org/I151201029","https://openalex.org/I4210127166"],"apc_list":null,"apc_paid":null,"fwci":4.5738,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.94797617,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"2","first_page":"290","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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.996999979019165,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6199832558631897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.606950581073761},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.5225900411605835},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.4906405508518219},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4622279107570648},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45597776770591736},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.4477998614311218},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4237786829471588},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.4198061227798462},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41316425800323486},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.32179543375968933},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.26203441619873047},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.26019352674484253},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.23863908648490906}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6199832558631897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.606950581073761},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.5225900411605835},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.4906405508518219},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4622279107570648},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45597776770591736},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.4477998614311218},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4237786829471588},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.4198061227798462},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41316425800323486},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.32179543375968933},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.26203441619873047},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26019352674484253},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.23863908648490906},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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":8,"locations":[{"id":"doi:10.1017/s1755020310000389","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020310000389","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/021B058177CA9738B490C1F373D12CA2/S1755020310000389a.pdf/div-class-title-the-expressive-power-of-memory-logics-div.pdf","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:CiteSeerX.psu:10.1.1.175.9781","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.9781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.glyc.dc.uba.ar/sergio/papers/rsl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.1820","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.1820","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.glyc.dc.uba.ar/sergio/papers/rsl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.398.2638","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.2638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.708.8061","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.8061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.famaf.unc.edu.ar/%7Ecareces/content/papers/files/RSL11.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01803447v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01803447","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"The review of symbolic logic, 2011, 4 (2), pp.290-318. ⟨10.1017/S1755020310000389⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:inria-00519040v1","is_oa":false,"landing_page_url":"https://hal.inria.fr/inria-00519040","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1755-0203","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ri.conicet.gov.ar:11336/68257","is_oa":true,"landing_page_url":"http://hdl.handle.net/11336/68257","pdf_url":null,"source":{"id":"https://openalex.org/S4306402455","display_name":"CONICET Digital (CONICET)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148385","host_organization_name":"Biomedicine Research Institute of Buenos Aires - CONICET - Partner Institute of the Max Planck Society","host_organization_lineage":["https://openalex.org/I4210148385"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s1755020310000389","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020310000389","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/021B058177CA9738B490C1F373D12CA2/S1755020310000389a.pdf/div-class-title-the-expressive-power-of-memory-logics-div.pdf","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"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2147756013.pdf","grobid_xml":"https://content.openalex.org/works/W2147756013.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W24399315","https://openalex.org/W1497616999","https://openalex.org/W1549008998","https://openalex.org/W1597914073","https://openalex.org/W1775249002","https://openalex.org/W1805258570","https://openalex.org/W1921921975","https://openalex.org/W1969184283","https://openalex.org/W1981808971","https://openalex.org/W2003017965","https://openalex.org/W2009786044","https://openalex.org/W2023844496","https://openalex.org/W2026629052","https://openalex.org/W2030263557","https://openalex.org/W2049696538","https://openalex.org/W2068458083","https://openalex.org/W2069300761","https://openalex.org/W2071089353","https://openalex.org/W2074452517","https://openalex.org/W2081421381","https://openalex.org/W2096959337","https://openalex.org/W2102447986","https://openalex.org/W2107168574","https://openalex.org/W2107171883","https://openalex.org/W2111706174","https://openalex.org/W2114710125","https://openalex.org/W2118434694","https://openalex.org/W2120613606","https://openalex.org/W2153871866","https://openalex.org/W2159131252","https://openalex.org/W2336123333","https://openalex.org/W2484955858","https://openalex.org/W2556173242","https://openalex.org/W2594688604","https://openalex.org/W2610670723","https://openalex.org/W2744622282","https://openalex.org/W2768141140","https://openalex.org/W2954327716","https://openalex.org/W2987907651","https://openalex.org/W3146075203","https://openalex.org/W4205313167","https://openalex.org/W4211144022","https://openalex.org/W4213255959","https://openalex.org/W4256000740"],"related_works":["https://openalex.org/W2782243532","https://openalex.org/W1854293932","https://openalex.org/W1576921484","https://openalex.org/W53707990","https://openalex.org/W2398566420","https://openalex.org/W2171395754","https://openalex.org/W1498755214","https://openalex.org/W2057232741","https://openalex.org/W1585071008","https://openalex.org/W2148171272"],"abstract_inverted_index":{"We":[0,102,127],"investigate":[1],"the":[2,15,21,38,44,64,73,79,82,93,98,110,118,130,136],"expressive":[3,108],"power":[4],"of":[5,24,54,59,70,72,107,133,135],"memory":[6,30,61,65,83,111],"logics":[7,12,112,137],".":[8],"These":[9],"are":[10],"modal":[11,120],"extended":[13],"with":[14,145],"possibility":[16],"to":[17,33,97],"store":[18],"(or":[19,27],"remove)":[20],"current":[22,39,94],"node":[23,95],"evaluation":[25],"in":[26,78,105],"from)":[28],"a":[29,56,60,85,146],",":[31,87],"and":[32,88,124],"perform":[34],"membership":[35],"tests":[36],"on":[37,156],"memory.":[40],"From":[41],"this":[42],"perspective,":[43],"hybrid":[45],"logic":[46,62,121,144],"\u210b\u2112":[47,125],"(\u2193),":[48],"for":[49],"example,":[50],"can":[51,90,159],"be":[52,160],"thought":[53],"as":[55],"particular":[57],"case":[58,80],"where":[63,81],"is":[66,84,140,150],"an":[67],"indexed":[68],"list":[69],"elements":[71,158],"domain.":[74],"This":[75],"work":[76],"focuses":[77],"set":[86,99],"we":[89,113,138],"test":[91],"whether":[92],"belongs":[96],"or":[100],"not.":[101],"prove":[103],"that,":[104],"terms":[106],"power,":[109],"discuss":[114],"here":[115],"lie":[116],"between":[117],"basic":[119],"${\\cal":[122],"K}$":[123],"(\u2193).":[126],"show":[128],"that":[129],"satisfiability":[131,148],"problem":[132,149],"most":[134],"cover":[139],"undecidable.":[141],"The":[142],"only":[143],"decidable":[147],"obtained":[151],"by":[152],"imposing":[153],"strong":[154],"constraints":[155],"which":[157],"memorized.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}