{"id":"https://openalex.org/W1982412713","doi":"https://doi.org/10.1145/2603088.2603117","title":"Logics with counting and equivalence","display_name":"Logics with counting and equivalence","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W1982412713","doi":"https://doi.org/10.1145/2603088.2603117","mag":"1982412713"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603117","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/A5033570514","display_name":"Ian Pratt\u2010Hartmann","orcid":"https://orcid.org/0000-0003-0062-043X"},"institutions":[{"id":"https://openalex.org/I170583851","display_name":"University of Opole","ror":"https://ror.org/04gbpnx96","country_code":"PL","type":"education","lineage":["https://openalex.org/I170583851"]},{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB","PL"],"is_corresponding":true,"raw_author_name":"Ian Pratt-Hartmann","raw_affiliation_strings":["University of Manchester and Opole University","University of Manchester and Opole University#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Manchester and Opole University","institution_ids":["https://openalex.org/I170583851","https://openalex.org/I28407311"]},{"raw_affiliation_string":"University of Manchester and Opole University#TAB#","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033570514"],"corresponding_institution_ids":["https://openalex.org/I170583851","https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":2.5371,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90651942,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"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/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/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9995999932289124,"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.818069338798523},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6005674600601196},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5525274276733398},{"id":"https://openalex.org/keywords/stipulation","display_name":"Stipulation","score":0.5492253303527832},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5253341197967529},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.50518399477005},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5028809905052185},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4328833520412445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34165674448013306},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.26427361369132996}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.818069338798523},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6005674600601196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5525274276733398},{"id":"https://openalex.org/C2781451568","wikidata":"https://www.wikidata.org/wiki/Q16965475","display_name":"Stipulation","level":2,"score":0.5492253303527832},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5253341197967529},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.50518399477005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5028809905052185},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4328833520412445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34165674448013306},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.26427361369132996},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2603088.2603117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603117","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.567.7473","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.567.7473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.man.ac.uk/~ipratt/papers/logic/c21e.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/a6673508-a64d-4729-a03f-965694f858a9","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/a6673508-a64d-4729-a03f-965694f858a9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pratt-Hartmann, I, Henzinger, T (ed.) & Miller, D (ed.) 2014, Logics with Counting and Equivalence. in T Henzinger & D Miller (eds), ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, pp. 1-10, CSL-LICS '14 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), Vienna, 12/07/14. https://doi.org/10.1145/2603088.2603117","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/a6673508-a64d-4729-a03f-965694f858a9","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/logics-with-counting-and-equivalence(a6673508-a64d-4729-a03f-965694f858a9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pratt-Hartmann, I, Henzinger, T (ed.) & Miller, D (ed.) 2014, Logics with Counting and Equivalence. in T Henzinger & D Miller (eds), ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, pp. 1-10, CSL-LICS '14 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), Vienna, 12/07/14. https://doi.org/10.1145/2603088.2603117","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G1463999682","display_name":null,"funder_award_id":"EP/K017438/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8463715073","display_name":"The Limits of Decidability: Counting, Transitivity, Equivalence","funder_award_id":"EP/K017438/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W11556686","https://openalex.org/W841006609","https://openalex.org/W1488636480","https://openalex.org/W1525403130","https://openalex.org/W1532158393","https://openalex.org/W1536964483","https://openalex.org/W1963547452","https://openalex.org/W1997817571","https://openalex.org/W2026405784","https://openalex.org/W2027602125","https://openalex.org/W2086470346","https://openalex.org/W2099081288","https://openalex.org/W2124580444","https://openalex.org/W2136823804","https://openalex.org/W2166108892","https://openalex.org/W2246583867","https://openalex.org/W2799061192","https://openalex.org/W4213255380","https://openalex.org/W4292003041","https://openalex.org/W6675051437","https://openalex.org/W6690709116","https://openalex.org/W6750047965","https://openalex.org/W6996888795"],"related_works":["https://openalex.org/W1556645209","https://openalex.org/W2782243532","https://openalex.org/W2963991671","https://openalex.org/W2240703591","https://openalex.org/W2585890227","https://openalex.org/W1543051890","https://openalex.org/W2189598663","https://openalex.org/W1962376575","https://openalex.org/W2398566420","https://openalex.org/W3176904788"],"abstract_inverted_index":{"We":[0,25,40],"consider":[1],"the":[2,12,28,44],"two-variable":[3,48],"fragment":[4],"of":[5],"first-order":[6,49],"logic":[7,36,50],"with":[8,51],"counting,":[9],"subject":[10],"to":[11],"stipulation":[13],"that":[14,27,43],"a":[15],"single":[16],"distinguished":[17],"binary":[18],"predicate":[19],"be":[20],"interpreted":[21],"as":[22],"an":[23],"equivalence.":[24],"show":[26,42],"satisfiability":[29,32],"and":[30,53],"finite":[31],"problems":[33,46],"for":[34,47],"this":[35],"are":[37,56],"both":[38,57],"NExpTime-complete.":[39],"further":[41],"corresponding":[45],"counting":[52],"two":[54],"equivalences":[55],"undecidable.":[58]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-19T08:26:33.389920","created_date":"2025-10-10T00:00:00"}