{"id":"https://openalex.org/W4415003872","doi":"https://doi.org/10.1109/lics65433.2025.00043","title":"Probabilistic Strategies: Definability and the Tensor Completeness Problem","display_name":"Probabilistic Strategies: Definability and the Tensor Completeness Problem","publication_year":2025,"publication_date":"2025-06-23","ids":{"openalex":"https://openalex.org/W4415003872","doi":"https://doi.org/10.1109/lics65433.2025.00043"},"language":"en","primary_location":{"id":"doi:10.1109/lics65433.2025.00043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics65433.2025.00043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 40th 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://pure-oai.bham.ac.uk/ws/files/277484663/refreshtensor.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112266022","display_name":"Nathan Bowler","orcid":null},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I70451448","display_name":"HAW Hamburg","ror":"https://ror.org/00fkqwx76","country_code":"DE","type":"education","lineage":["https://openalex.org/I70451448"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nathan Bowler","raw_affiliation_strings":["University of Hamburg,Department of Mathematics,Hamburg,Germany"],"affiliations":[{"raw_affiliation_string":"University of Hamburg,Department of Mathematics,Hamburg,Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I70451448"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005129928","display_name":"\u0421. \u0421. \u0413\u043e\u043d\u0447\u0430\u0440\u043e\u0432","orcid":"https://orcid.org/0000-0001-7465-1189"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sergey Goncharov","raw_affiliation_strings":["University of Birmingham,School of Computer Science,Birmingham,UK"],"affiliations":[{"raw_affiliation_string":"University of Birmingham,School of Computer Science,Birmingham,UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053041930","display_name":"Paul Blain Levy","orcid":"https://orcid.org/0000-0003-0864-1876"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul Blain Levy","raw_affiliation_strings":["University of Birmingham,School of Computer Science,Birmingham,UK"],"affiliations":[{"raw_affiliation_string":"University of Birmingham,School of Computer Science,Birmingham,UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112266022"],"corresponding_institution_ids":["https://openalex.org/I159176309","https://openalex.org/I70451448"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30757736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"485","last_page":"498"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9735000133514404,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9735000133514404,"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/T10142","display_name":"Formal Methods in Verification","score":0.9370999932289124,"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.9323999881744385,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7810999751091003},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6711000204086304},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6579999923706055},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.631600022315979},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.5455999970436096},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5400000214576721},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.4855000078678131},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4731000065803528}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7810999751091003},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6711000204086304},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6579999923706055},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.631600022315979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6050000190734863},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.5455999970436096},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5400000214576721},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4731000065803528},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.44429999589920044},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4203999936580658},{"id":"https://openalex.org/C132074034","wikidata":"https://www.wikidata.org/wiki/Q154210","display_name":"Congruence (geometry)","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C64357122","wikidata":"https://www.wikidata.org/wiki/Q1149766","display_name":"Causality (physics)","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29280000925064087},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2736000120639801},{"id":"https://openalex.org/C128394911","wikidata":"https://www.wikidata.org/wiki/Q1987578","display_name":"Unit interval","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C9973445","wikidata":"https://www.wikidata.org/wiki/Q8349849","display_name":"Congruence relation","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C521332185","wikidata":"https://www.wikidata.org/wiki/Q185816","display_name":"Analogy","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.2533000111579895}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics65433.2025.00043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics65433.2025.00043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/2cfd650a-196f-4b9a-8d19-59836fbb7ca3","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/2cfd650a-196f-4b9a-8d19-59836fbb7ca3","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/277484663/refreshtensor.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bowler, N, Goncharov, S & Levy, P 2025, Probabilistic Strategies : Definability and the Tensor Completeness Problem. in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Proceedings - Symposium on Logic in Computer Science, IEEE, pp. 485-498, 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, Singapore, 23/06/25. https://doi.org/10.1109/LICS65433.2025.00043","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/2cfd650a-196f-4b9a-8d19-59836fbb7ca3","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/2cfd650a-196f-4b9a-8d19-59836fbb7ca3","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/277484663/refreshtensor.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bowler, N, Goncharov, S & Levy, P 2025, Probabilistic Strategies : Definability and the Tensor Completeness Problem. in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Proceedings - Symposium on Logic in Computer Science, IEEE, pp. 485-498, 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, Singapore, 23/06/25. https://doi.org/10.1109/LICS65433.2025.00043","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415003872.pdf","grobid_xml":"https://content.openalex.org/works/W4415003872.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Programs":[0],"that":[1,92,112,142,188],"combine":[2],"I/O":[3,99],"and":[4,37,67],"countable":[5],"probabilistic":[6,20,95,137,144],"choice,":[7],"modulo":[8],"either":[9,93],"bisimilarity":[10,30,58],"or":[11,97],"trace":[12,38,76,117,145],"equivalence,":[13,77],"can":[14,189],"be":[15,190],"seen":[16],"as":[17,120,148],"describing":[18],"a":[19,32,41,63,143,152],"strategy.":[21],"For":[22],"well-founded":[23,153],"programs,":[24],"we":[25,86,140],"might":[26],"expect":[27],"to":[28,109,131,185,192],"axiomatize":[29],"via":[31,40,62],"sum":[33,64],"of":[34,43,65,125,135,151,173],"equational":[35],"theories":[36],"equivalence":[39],"tensor":[42,69,114],"such":[44],"theories.":[45],"This":[46,127,159],"is":[47,59,70,157,165,177],"by":[48],"analogy":[49],"with":[50],"similar":[51],"results":[52,181],"for":[53,75],"nondeterminism,":[54],"established":[55],"previously.":[56],"While":[57],"indeed":[60,71],"axiomatized":[61],"theories,":[66],"the":[68,90,94,98,113,122,132,136,149,163,171],"at":[72],"least":[73],"sound":[74],"completeness":[78,88,107,129],"in":[79,89],"general,":[80],"remains":[81],"an":[82],"open":[83,183],"problem.":[84],"Nevertheless,":[85],"show":[87,106,141],"case":[91],"choice":[96,138],"operations":[100],"used":[101,191],"are":[102],"finitary.":[103],"We":[104],"also":[105],"up":[108,130],"impersonation,":[110],"i.e.":[111],"theory":[115],"regards":[116],"equivalent":[118],"programs":[119],"solving":[121],"same":[123],"system":[124],"equations.":[126],"entails":[128],"cancellation":[133],"law":[134],"operator.Furthermore,":[139],"strategy":[146,164],"arises":[147],"semantics":[150],"program":[154],"iff":[155],"it":[156],"victorious.":[158],"means":[160],"that,":[161],"when":[162],"played":[166],"against":[167],"any":[168],"partial":[169],"counterstrategy,":[170],"probability":[172],"play":[174],"continuing":[175],"forever":[176],"zero.We":[178],"link":[179],"our":[180],"(and":[182],"problem)":[184],"particular":[186],"monads":[187],"model":[193],"computational":[194],"effects.":[195]},"counts_by_year":[],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}