{"id":"https://openalex.org/W3037251419","doi":"https://doi.org/10.2168/lmcs-9(3:25)2013","title":"Unary negation","display_name":"Unary negation","publication_year":2013,"publication_date":"2013-09-24","ids":{"openalex":"https://openalex.org/W3037251419","doi":"https://doi.org/10.2168/lmcs-9(3:25)2013","mag":"3037251419"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-9(3:25)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(3:25)2013","pdf_url":"https://lmcs.episciences.org/792/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/792/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042411667","display_name":"Luc Segoufin","orcid":"https://orcid.org/0000-0002-9564-7581"},"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":"Luc Segoufin","raw_affiliation_strings":["INRIA and ENS Cachan, LSV","San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA and ENS Cachan, LSV","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080220262","display_name":"Balder ten Cate","orcid":"https://orcid.org/0000-0002-2538-5846"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Balder ten Cate","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042411667"],"corresponding_institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":4.3743,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.94850612,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 9, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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.7434393167495728},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.7307989597320557},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7227789163589478},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6393600702285767},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6018545627593994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5667843818664551},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.488292932510376},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.46820738911628723},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.4676026403903961},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41830724477767944},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.41174620389938354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25513193011283875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24552321434020996},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2107807695865631},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.2019498348236084},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.1799183189868927},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.10888078808784485}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7434393167495728},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.7307989597320557},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7227789163589478},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6393600702285767},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6018545627593994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5667843818664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.488292932510376},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.46820738911628723},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.4676026403903961},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41830724477767944},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.41174620389938354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25513193011283875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24552321434020996},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2107807695865631},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.2019498348236084},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.1799183189868927},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.10888078808784485},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-9(3:25)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(3:25)2013","pdf_url":"https://lmcs.episciences.org/792/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1309.2069","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.2069","pdf_url":"https://arxiv.org/pdf/1309.2069","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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:doaj.org/article:006e45219f3c4d108d29264b660d94cb","is_oa":true,"landing_page_url":"https://doaj.org/article/006e45219f3c4d108d29264b660d94cb","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-9(3:25)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(3:25)2013","pdf_url":"https://lmcs.episciences.org/792/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G2073314624","display_name":"III: Small: Aspects of Integrating Heterogeneous and Inconsistent Data","funder_award_id":"1217869","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2640021470","display_name":"III: Medium: Data Interoperability via Schema Mappings","funder_award_id":"0905276","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G423145793","display_name":null,"funder_award_id":"226513","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3037251419.pdf","grobid_xml":"https://content.openalex.org/works/W3037251419.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W42015762","https://openalex.org/W193724012","https://openalex.org/W1482768571","https://openalex.org/W1483388050","https://openalex.org/W1483892218","https://openalex.org/W1489366126","https://openalex.org/W1505211902","https://openalex.org/W1509363043","https://openalex.org/W1526271624","https://openalex.org/W1549008998","https://openalex.org/W1558081775","https://openalex.org/W1600958215","https://openalex.org/W1749183653","https://openalex.org/W1778829768","https://openalex.org/W1893650332","https://openalex.org/W1991981864","https://openalex.org/W1995214664","https://openalex.org/W2004894395","https://openalex.org/W2015640848","https://openalex.org/W2021711161","https://openalex.org/W2043132490","https://openalex.org/W2044280967","https://openalex.org/W2069709605","https://openalex.org/W2070632872","https://openalex.org/W2074385562","https://openalex.org/W2081973669","https://openalex.org/W2089546742","https://openalex.org/W2110472925","https://openalex.org/W2117309455","https://openalex.org/W2124876285","https://openalex.org/W2128710701","https://openalex.org/W2134826526","https://openalex.org/W2144171837","https://openalex.org/W2151784388","https://openalex.org/W2159701549","https://openalex.org/W2160442532","https://openalex.org/W2340735175","https://openalex.org/W2799061192","https://openalex.org/W2952534738","https://openalex.org/W3146347964","https://openalex.org/W4235748441","https://openalex.org/W4301791419"],"related_works":["https://openalex.org/W2033265717","https://openalex.org/W2584847196","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W3102809343","https://openalex.org/W4298153058","https://openalex.org/W1539443054","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W2963254029"],"abstract_inverted_index":{"We":[0,47,71],"study":[1],"fragments":[2],"of":[3,7,18,64,79],"first-order":[4,80],"logic":[5,11,35,81],"and":[6,36,44,51,59,68,93],"least":[8],"fixed":[9],"point":[10],"that":[12,49,74],"allow":[13],"only":[14],"unary":[15,76],"negation:":[16],"negation":[17,77],"formulas":[19],"with":[20],"at":[21],"most":[22],"one":[23],"free":[24],"variable.":[25],"These":[26],"logics":[27],"generalize":[28],"many":[29],"interesting":[30],"known":[31],"formalisms,":[32],"including":[33],"modal":[34],"the":[37,62,75,94],"$\\mu$-calculus,":[38],"as":[39,41],"well":[40,85],"conjunctive":[42],"queries":[43],"monadic":[45],"Datalog.":[46],"show":[48,73],"satisfiability":[50,53],"finite":[52,66],"are":[54],"decidable":[55],"for":[56],"both":[57],"fragments,":[58],"we":[60],"pinpoint":[61],"complexity":[63],"satisfiability,":[65,67],"model":[69],"checking.":[70],"also":[72],"fragment":[78],"is":[82],"model-theoretically":[83],"very":[84],"behaved.":[86],"In":[87],"particular,":[88],"it":[89],"enjoys":[90],"Craig":[91],"Interpolation":[92],"Projective":[95],"Beth":[96],"Property.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-13T07:31:44.756512","created_date":"2020-07-02T00:00:00"}