{"id":"https://openalex.org/W2966181201","doi":"https://doi.org/10.1109/lics.2019.8785681","title":"On the Existential Theories of B\u00fcchi Arithmetic and Linear p-adic Fields","display_name":"On the Existential Theories of B\u00fcchi Arithmetic and Linear p-adic Fields","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2966181201","doi":"https://doi.org/10.1109/lics.2019.8785681","mag":"2966181201"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://discovery.ucl.ac.uk/10089190/1/Haase_ghw-19%20%28002%29.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037762220","display_name":"Florent Guepin","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Florent Guepin","raw_affiliation_strings":["ENS Lyon, France"],"affiliations":[{"raw_affiliation_string":"ENS Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067755649","display_name":"Christoph Haase","orcid":"https://orcid.org/0000-0002-5452-936X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Christoph Haase","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068165188","display_name":"James Worrell","orcid":"https://orcid.org/0000-0001-8151-2443"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James Worrell","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037762220"],"corresponding_institution_ids":["https://openalex.org/I113428412"],"apc_list":null,"apc_paid":null,"fwci":0.9996,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78729455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T10588","display_name":"Mathematical Dynamics and Fractals","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9904999732971191,"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/mathematics","display_name":"Mathematics","score":0.6781583428382874},{"id":"https://openalex.org/keywords/diophantine-equation","display_name":"Diophantine equation","score":0.6207576394081116},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.5693219304084778},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5466161966323853},{"id":"https://openalex.org/keywords/existentialism","display_name":"Existentialism","score":0.5327902436256409},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5171060562133789},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4999096393585205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4991190433502197},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.48141953349113464},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.45030179619789124},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.43258556723594666},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.34488803148269653},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.20133191347122192},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1595955193042755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15063312649726868},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11721161007881165}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6781583428382874},{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.6207576394081116},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.5693219304084778},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5466161966323853},{"id":"https://openalex.org/C127882523","wikidata":"https://www.wikidata.org/wiki/Q38066","display_name":"Existentialism","level":2,"score":0.5327902436256409},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5171060562133789},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4999096393585205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4991190433502197},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.48141953349113464},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.45030179619789124},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.43258556723594666},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.34488803148269653},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.20133191347122192},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1595955193042755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15063312649726868},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11721161007881165},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2019.8785681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10089190","is_oa":true,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10089190/","pdf_url":"https://discovery.ucl.ac.uk/10089190/1/Haase_ghw-19%20%28002%29.pdf","source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:  Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).    IEEE: Vancouver, BC, Canada. (2019)     ","raw_type":"Proceedings paper"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:a85cdf1b-189c-43b2-8800-105f3b36cfb5","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:a85cdf1b-189c-43b2-8800-105f3b36cfb5","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference item"}],"best_oa_location":{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10089190","is_oa":true,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10089190/","pdf_url":"https://discovery.ucl.ac.uk/10089190/1/Haase_ghw-19%20%28002%29.pdf","source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:  Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).    IEEE: Vancouver, BC, Canada. (2019)     ","raw_type":"Proceedings paper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2704700155","display_name":null,"funder_award_id":"EP/N008197/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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2966181201.pdf","grobid_xml":"https://content.openalex.org/works/W2966181201.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W205112229","https://openalex.org/W1524248088","https://openalex.org/W1525561120","https://openalex.org/W1963547452","https://openalex.org/W1971747251","https://openalex.org/W1998927893","https://openalex.org/W2004542062","https://openalex.org/W2008644136","https://openalex.org/W2009486845","https://openalex.org/W2028207499","https://openalex.org/W2030999998","https://openalex.org/W2056162328","https://openalex.org/W2071228820","https://openalex.org/W2081719649","https://openalex.org/W2089107726","https://openalex.org/W2104715607","https://openalex.org/W2131742729","https://openalex.org/W2139480317","https://openalex.org/W2149932816","https://openalex.org/W2163696969","https://openalex.org/W2319305328","https://openalex.org/W2319549236","https://openalex.org/W2397246836","https://openalex.org/W2401610261","https://openalex.org/W2544425934","https://openalex.org/W2963314464","https://openalex.org/W3149604617","https://openalex.org/W3162566251","https://openalex.org/W4205178514","https://openalex.org/W4298262456","https://openalex.org/W6729122178"],"related_works":["https://openalex.org/W4225592929","https://openalex.org/W4294016381","https://openalex.org/W3130346675","https://openalex.org/W4360831352","https://openalex.org/W2583753471","https://openalex.org/W2122700562","https://openalex.org/W2922024459","https://openalex.org/W2294297515","https://openalex.org/W1587864502","https://openalex.org/W1540595797"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,5,9,17,61,74,77,87,102],"complexity":[3],"of":[4,12,20,76,89,95,104,106,110],"satisfiability":[6],"problems":[7,32],"for":[8,16,39],"existential":[10,18,40],"fragment":[11,19],"B\u00fcchi":[13],"arithmetic":[14,22,42],"and":[15,58],"linear":[21,41,111],"over":[23,43],"p-adic":[24,44],"fields.":[25],"Our":[26],"main":[27],"results":[28],"are":[29,33],"that":[30,63,86],"both":[31,67],"NP-complete.":[34],"The":[35],"NP":[36],"upper":[37],"bound":[38],"fields":[45],"resolves":[46],"an":[47],"open":[48],"question":[49],"posed":[50],"by":[51],"Weispfenning":[52],"[J.":[53],"Symb.":[54],"Comput.,":[55],"5(1/2)":[56],"(1988)]":[57],"holds":[59],"despite":[60],"fact":[62],"satisfying":[64],"assignments":[65],"in":[66,73,117],"theories":[68],"may":[69],"have":[70],"bit-size":[71],"super-polynomial":[72],"description":[75],"formula.":[78],"A":[79],"key":[80],"technical":[81],"contribution":[82],"is":[83],"to":[84],"show":[85],"existence":[88],"a":[90,96,107],"path":[91],"between":[92],"two":[93],"states":[94],"finite-state":[97],"automaton":[98],"whose":[99],"language":[100],"encodes":[101],"set":[103],"solutions":[105],"given":[108],"system":[109],"Diophantine":[112],"equations":[113],"can":[114],"be":[115],"witnessed":[116],"NP.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}