{"id":"https://openalex.org/W4379193133","doi":"https://doi.org/10.29007/1xns","title":"An excursion to the border of decidability: between two- and three-variable logic","display_name":"An excursion to the border of decidability: between two- and three-variable logic","publication_year":2023,"publication_date":"2023-06-03","ids":{"openalex":"https://openalex.org/W4379193133","doi":"https://doi.org/10.29007/1xns"},"language":"en","primary_location":{"id":"doi:10.29007/1xns","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/1xns","pdf_url":"https://easychair.org/publications/paper/KVm2/download","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/paper/KVm2/download","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085359233","display_name":"Oskar Fiuk","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oskar Fiuk","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5090488658","display_name":"Emanuel Kiero\u0144ski","orcid":"https://orcid.org/0000-0002-8538-8221"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emanuel Kieronski","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085359233"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2028,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52565895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"94","issue":null,"first_page":"205","last_page":"185"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9991000294685364,"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.9979000091552734,"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/T11567","display_name":"semigroups and automata theory","score":0.9951000213623047,"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.8990857601165771},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.8688626289367676},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7700732350349426},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.686752200126648},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5587399005889893},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5207226872444153},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5190216302871704},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.515531063079834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4802113473415375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3938145637512207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2646292448043823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25841498374938965},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.075446218252182}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8990857601165771},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8688626289367676},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7700732350349426},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.686752200126648},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5587399005889893},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5207226872444153},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5190216302871704},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.515531063079834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4802113473415375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3938145637512207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2646292448043823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25841498374938965},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.075446218252182},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/1xns","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/1xns","pdf_url":"https://easychair.org/publications/paper/KVm2/download","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/1xns","is_oa":true,"landing_page_url":"http://dx.doi.org/10.29007/1xns","pdf_url":"https://easychair.org/publications/paper/KVm2/download","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4379193133.pdf","grobid_xml":"https://content.openalex.org/works/W4379193133.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2585890227","https://openalex.org/W1543051890"],"abstract_inverted_index":{"With":[0],"respect":[1],"to":[2],"the":[3,7,16,35,62,77],"number":[4],"of":[5,9,19,50,76,81],"variables":[6],"border":[8],"decidability":[10],"lies":[11],"between":[12],"2":[13],"and":[14,28,57,66],"3:":[15],"two-variable":[17],"fragment":[18,70],"first-order":[20],"logic,":[21],"FO2,":[22],"has":[23],"an":[24,74],"exponential":[25],"model":[26,64],"property":[27,65],"hence":[29],"NExpTime-complete":[30],"satisfiability":[31,39],"problem,":[32],"while":[33],"for":[34],"three-variable":[36],"fragment,":[37],"FO3,":[38,51],"is":[40,71],"undecidable.":[41],"In":[42],"this":[43],"paper":[44],"we":[45],"propose":[46],"a":[47],"rich":[48],"subfragment":[49],"containing":[52],"full":[53],"FO2":[54],"(without":[55],"equality),":[56],"show":[58],"that":[59],"it":[60],"retains":[61],"finite":[63],"NExpTime":[67],"complexity.":[68],"Our":[69],"obtained":[72],"as":[73],"extension":[75],"uniform":[78],"one-dimensional":[79],"variant":[80],"FO3.":[82]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}