{"id":"https://openalex.org/W2116121326","doi":"https://doi.org/10.1017/s1755020310000146","title":"DECIDABILITY OF INDEPENDENCE-FRIENDLY MODAL LOGIC","display_name":"DECIDABILITY OF INDEPENDENCE-FRIENDLY MODAL LOGIC","publication_year":2010,"publication_date":"2010-07-13","ids":{"openalex":"https://openalex.org/W2116121326","doi":"https://doi.org/10.1017/s1755020310000146","mag":"2116121326"},"language":"en","primary_location":{"id":"doi:10.1017/s1755020310000146","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1755020310000146","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038637017","display_name":"Merlijn Sevenster","orcid":"https://orcid.org/0000-0003-4118-9551"},"institutions":[{"id":"https://openalex.org/I4210133649","display_name":"Philips (India)","ror":"https://ror.org/0435vfk93","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210122849","https://openalex.org/I4210133649"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"MERLIJN SEVENSTER","raw_affiliation_strings":["Philips Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Philips Research","institution_ids":["https://openalex.org/I4210133649"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038637017"],"corresponding_institution_ids":["https://openalex.org/I4210133649"],"apc_list":null,"apc_paid":null,"fwci":1.3776,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.85263615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"3","first_page":"415","last_page":"441"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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.9934999942779541,"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/undecidable-problem","display_name":"Undecidable problem","score":0.6063134074211121},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.589926540851593},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5600284934043884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49083906412124634},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4595315754413605},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.4476656913757324},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4356841444969177},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4294761121273041},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.41177135705947876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37241917848587036},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.28497421741485596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.269756555557251},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.2626068592071533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2314722239971161},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1986311674118042},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.16256368160247803}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6063134074211121},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.589926540851593},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5600284934043884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49083906412124634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4595315754413605},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.4476656913757324},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4356841444969177},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4294761121273041},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.41177135705947876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37241917848587036},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.28497421741485596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.269756555557251},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.2626068592071533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2314722239971161},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1986311674118042},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.16256368160247803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1755020310000146","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1755020310000146","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W39085972","https://openalex.org/W1491357268","https://openalex.org/W1501571921","https://openalex.org/W1522783060","https://openalex.org/W1548835575","https://openalex.org/W1759871617","https://openalex.org/W1778486997","https://openalex.org/W1815779771","https://openalex.org/W1973302434","https://openalex.org/W1977394840","https://openalex.org/W1990514682","https://openalex.org/W1991981864","https://openalex.org/W2072395631","https://openalex.org/W2107171883","https://openalex.org/W2147093959","https://openalex.org/W2156038678","https://openalex.org/W2164297607","https://openalex.org/W2232005191","https://openalex.org/W2610670723","https://openalex.org/W3022537480","https://openalex.org/W3146475326","https://openalex.org/W4211144022","https://openalex.org/W4213009134","https://openalex.org/W4256000740","https://openalex.org/W4285719527","https://openalex.org/W6629810137"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2585890227","https://openalex.org/W1543051890"],"abstract_inverted_index":{"In":[0],"this":[1,79],"paper":[2,80],"we":[3,98],"consider":[4],"an":[5],"independence-friendly":[6],"modal":[7],"logic,":[8,28],"IFML.":[9],"It":[10,39],"follows":[11],"from":[12,111],"results":[13],"in":[14,74],"the":[15,46,55,63,100,112],"literature":[16],"that":[17,32,43,52,68,78,93],"qua":[18],"expressive":[19],"power,":[20],"IFML":[21,44,53,94],"is":[22,40,72],"a":[23,59,82,109],"fragment":[24,85],"of":[25,62,86,108],"second-order":[26],"existential":[27],"$\\Sigma":[29,87],"_1^1$":[30,88],",":[31],"cannot":[33],"be":[34],"translated":[35],"into":[36],"first-order":[37],"logic.":[38],"also":[41,91],"known":[42],"lacks":[45],"tree":[47,64],"structure":[48,57,65],"property.":[49],"We":[50,90],"show":[51,92],"has":[54],"\u2018truncated":[56],"property\u2019,":[58],"weaker":[60],"version":[61],"property,":[66],"and":[67],"its":[69,104],"satisfiability":[70],"problem":[71],"solvable":[73],"2NEXP.":[75],"This":[76],"implies":[77],"reveals":[81],"new":[83],"decidable":[84],".":[89],"becomes":[95],"undecidable":[96],"if":[97],"add":[99],"identity":[101],"symbol":[102],"to":[103],"vocabulary":[105],"by":[106],"means":[107],"reduction":[110],"tiling":[113],"problem.":[114]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}