{"id":"https://openalex.org/W2025535135","doi":"https://doi.org/10.1145/2603088.2603134","title":"Decidability of weak logics with deterministic transitive closure","display_name":"Decidability of weak logics with deterministic transitive closure","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W2025535135","doi":"https://doi.org/10.1145/2603088.2603134","mag":"2025535135"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603134","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-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/A5068443996","display_name":"Witold Charatonik","orcid":"https://orcid.org/0000-0001-7062-0385"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Witold Charatonik","raw_affiliation_strings":["University of Wroc\u0142aw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090488658","display_name":"Emanuel Kiero\u0144ski","orcid":"https://orcid.org/0000-0002-8538-8221"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Emanuel Kiero\u0144ski","raw_affiliation_strings":["University of Wroc\u0142aw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004165473","display_name":"Filip Mazowiecki","orcid":"https://orcid.org/0000-0002-4535-6508"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Filip Mazowiecki","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw , Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068443996"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":2.8631,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.91834675,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","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/T10126","display_name":"Logic, programming, and type systems","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/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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.881270170211792},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.8613238334655762},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.7364727854728699},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6853535771369934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6773631572723389},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6474963426589966},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.614819347858429},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.5493587255477905},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5482909083366394},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5391505360603333},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.4903600215911865},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.44362255930900574},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4414418339729309},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.43061354756355286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2946803569793701},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27223706245422363},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.2644807994365692},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2042614221572876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0871797502040863},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07808604836463928}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.881270170211792},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8613238334655762},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.7364727854728699},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6853535771369934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6773631572723389},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6474963426589966},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.614819347858429},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.5493587255477905},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5482909083366394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5391505360603333},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4903600215911865},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.44362255930900574},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4414418339729309},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.43061354756355286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2946803569793701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27223706245422363},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.2644807994365692},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2042614221572876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0871797502040863},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07808604836463928},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2603088.2603134","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3396802599","display_name":null,"funder_award_id":"DEC-2011/03/B/ST6/00346, DEC-2013/09/B/ST6/01535, DEC-2013/09/N/ST6/01170","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W6480589","https://openalex.org/W1485718948","https://openalex.org/W1518197906","https://openalex.org/W1532158393","https://openalex.org/W1536964483","https://openalex.org/W1564256547","https://openalex.org/W1577924337","https://openalex.org/W1579865136","https://openalex.org/W1970629906","https://openalex.org/W1987019087","https://openalex.org/W1997817571","https://openalex.org/W2008070102","https://openalex.org/W2017018565","https://openalex.org/W2025750846","https://openalex.org/W2047674711","https://openalex.org/W2066800627","https://openalex.org/W2080220005","https://openalex.org/W2086470346","https://openalex.org/W2099081288","https://openalex.org/W2104419987","https://openalex.org/W2124322005","https://openalex.org/W2124580444","https://openalex.org/W2136823804","https://openalex.org/W2137628566","https://openalex.org/W2166108892","https://openalex.org/W2246583867","https://openalex.org/W2258592034","https://openalex.org/W2274401127","https://openalex.org/W2293300167","https://openalex.org/W2735488008","https://openalex.org/W6633774989","https://openalex.org/W6641176790","https://openalex.org/W6690709116"],"related_works":["https://openalex.org/W2075704325","https://openalex.org/W1553139688","https://openalex.org/W1503149859","https://openalex.org/W2044040096","https://openalex.org/W2111304739","https://openalex.org/W2119876047","https://openalex.org/W2113317244","https://openalex.org/W1997826500","https://openalex.org/W2168681835","https://openalex.org/W1550770522"],"abstract_inverted_index":{"The":[0],"deterministic":[1,63,98,123],"transitive":[2,64,99],"closure":[3,65,124],"operator,":[4],"added":[5],"to":[6,14,133],"languages":[7],"containing":[8],"even":[9],"only":[10],"two":[11],"variables,":[12],"allows":[13],"express":[15],"many":[16],"natural":[17],"properties":[18],"of":[19,43,54,58,66,93,101,112],"a":[20,25,28,30,33,39,67],"binary":[21,69,103],"relation,":[22,70],"including":[23],"being":[24],"linear":[26],"order,":[27],"tree,":[29],"forest":[31],"or":[32],"partial":[34],"function.":[35],"This":[36,88],"makes":[37],"it":[38],"potentially":[40],"attractive":[41],"ingredient":[42],"computer":[44],"science":[45],"formalisms.":[46],"In":[47],"this":[48,141],"paper":[49],"we":[50],"consider":[51,109],"the":[52,55,62,74,81,91,97,110],"extension":[53],"two-variable":[56,94],"fragment":[57],"first-order":[59,114],"logic":[60,83,95],"by":[61,122,129],"single":[68],"and":[71,76,86,136],"prove":[72],"that":[73],"satisfiability":[75,78],"finite":[77],"problems":[79],"for":[80],"obtained":[82],"are":[84],"decidable":[85],"ExpSpace-complete.":[87],"contrasts":[89],"with":[90,96],"undecidability":[92,137],"closures":[100],"several":[102],"relations,":[104],"known":[105],"before.":[106],"We":[107,139],"also":[108],"class":[111],"universal":[113],"formulas":[115],"in":[116,143],"prenex":[117],"form.":[118],"Its":[119],"various":[120],"extensions":[121],"operations":[125],"were":[126],"earlier":[127],"considered":[128],"other":[130],"authors,":[131],"leading":[132],"both":[134],"decidability":[135],"results.":[138],"examine":[140],"scenario":[142],"more":[144],"details.":[145]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}