{"id":"https://openalex.org/W2065560971","doi":"https://doi.org/10.1016/s1571-0661(05)80317-2","title":"Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version)","display_name":"Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version)","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2065560971","doi":"https://doi.org/10.1016/s1571-0661(05)80317-2","mag":"2065560971"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80317-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80317-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80317-2","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000119795","display_name":"Andrzej S. Murawski","orcid":"https://orcid.org/0000-0002-4725-410X"},"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":"A.S. Murawski","raw_affiliation_strings":["Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK","Oxford University Computing Laboratory   Wolfson Building, Parks Road   Oxford OX1 3QD, UK"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory   Wolfson Building, Parks Road   Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025152913","display_name":"C.-H. Luke Ong","orcid":"https://orcid.org/0000-0001-7509-680X"},"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":true,"raw_author_name":"C.-H.L. Ong","raw_affiliation_strings":["Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK","Oxford University Computing Laboratory   Wolfson Building, Parks Road   Oxford OX1 3QD, UK"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University Computing Laboratory   Wolfson Building, Parks Road   Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025152913"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.5293,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8529614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":null,"first_page":"209","last_page":"239"},"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.9994999766349792,"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.9994999766349792,"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.9994999766349792,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.996399998664856,"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/multiplicative-function","display_name":"Multiplicative function","score":0.6181215047836304},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6179290413856506},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.5964131355285645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5090193748474121},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.49866700172424316},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.4550153315067291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4347647726535797},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3321123719215393},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29847800731658936},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24511149525642395},{"id":"https://openalex.org/keywords/mathematics-education","display_name":"Mathematics education","score":0.08159816265106201}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6181215047836304},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6179290413856506},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.5964131355285645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5090193748474121},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.49866700172424316},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.4550153315067291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4347647726535797},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3321123719215393},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29847800731658936},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24511149525642395},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.08159816265106201},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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.1016/s1571-0661(05)80317-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80317-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80317-2","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80317-2","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320290","display_name":"University of Oxford","ror":"https://ror.org/052gg0110"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1512931629","https://openalex.org/W1526036637","https://openalex.org/W1985063546","https://openalex.org/W1993205599","https://openalex.org/W2024189573","https://openalex.org/W2088895474","https://openalex.org/W2094685149","https://openalex.org/W2095436832","https://openalex.org/W2911865844","https://openalex.org/W6631311380"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W2116032385","https://openalex.org/W4288043137"],"abstract_inverted_index":{"We":[0,31,85],"present":[1],"a":[2,17,36,78,94],"game":[3,39],"description":[4],"of":[5,80,93],"free":[6,98],"symmetric":[7],"monoidal":[8],"closed":[9],"categories,":[10],"which":[11,59,101],"can":[12],"also":[13],"be":[14],"viewed":[15],"as":[16],"fully":[18],"complete":[19],"model":[20,32,88],"for":[21],"the":[22,28,33,46,73,87,103],"Intuitionistic":[23],"Multiplicative":[24],"Linear":[25],"Logic":[26],"with":[27],"tensor":[29],"unit.":[30],"unit":[34],"by":[35,52],"distinguished":[37],"one-move":[38],"called":[40,83],"Joker.":[41],"Special":[42],"rules":[43],"apply":[44],"to":[45,89],"joker":[47,69],"move.":[48],"Proofs":[49],"are":[50,60],"modelled":[51],"what":[53],"we":[54],"call":[55],"conditionally":[56],"exhausting":[57],"strategies,":[58],"deterministic":[61],"and":[62,76],"total":[63],"only":[64],"at":[65],"positions":[66],"where":[67],"no":[68],"move":[70],"exists":[71],"in":[72,97],"immediate":[74],"neighbourhood,":[75],"satisfy":[77],"kind":[79],"reachability":[81],"condition":[82],"P-exhaustion.":[84],"use":[86],"give":[90],"an":[91],"analysis":[92],"counting":[95],"problem":[96],"autonomous":[99],"categories":[100],"generalises":[102],"Triple":[104],"Unit":[105],"Problem.":[106]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}