{"id":"https://openalex.org/W4237646746","doi":"https://doi.org/10.1109/lics.2017.8005127","title":"Typability in bounded dimension","display_name":"Typability in bounded dimension","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W4237646746","doi":"https://doi.org/10.1109/lics.2017.8005127"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd 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/A5017299598","display_name":"Andrej Dudenhefner","orcid":"https://orcid.org/0000-0003-1104-444X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andrej Dudenhefner","raw_affiliation_strings":["Faculty of Computer Science, Tecnical University, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Tecnical University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081497785","display_name":"Jakob Rehof","orcid":"https://orcid.org/0000-0002-6023-8921"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jakob Rehof","raw_affiliation_strings":["Faculty of Computer Science, Technical University, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Technical University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017299598"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.39,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73698451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2044","issue":null,"first_page":"1","last_page":"12"},"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.9991000294685364,"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.9991000294685364,"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.9979000091552734,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.991599977016449,"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/bounded-function","display_name":"Bounded function","score":0.7868900299072266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.663426399230957},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6369851231575012},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6186726689338684},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5769202709197998},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49509087204933167},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.4768158793449402},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.437202513217926},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.42779308557510376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3260565996170044}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7868900299072266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.663426399230957},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6369851231575012},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6186726689338684},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5769202709197998},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49509087204933167},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.4768158793449402},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.437202513217926},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.42779308557510376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3260565996170044},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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.1109/lics.2017.8005127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W115606789","https://openalex.org/W207411393","https://openalex.org/W1585533089","https://openalex.org/W1596346405","https://openalex.org/W1970227944","https://openalex.org/W2056253254","https://openalex.org/W2072881702","https://openalex.org/W2085670481","https://openalex.org/W2099162225","https://openalex.org/W2119240423","https://openalex.org/W2119756648","https://openalex.org/W2196653126","https://openalex.org/W2214437647","https://openalex.org/W2246934006","https://openalex.org/W2561623690","https://openalex.org/W4239310085","https://openalex.org/W4300106609","https://openalex.org/W6675677550","https://openalex.org/W6690630281"],"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/W2020140696","https://openalex.org/W1485718948"],"abstract_inverted_index":{"Recently":[0],"(authors,":[1],"POPL":[2],"2017),":[3],"a":[4,25,61,82,92,109],"notion":[5],"of":[6,28,63,98,112],"dimensionality":[7],"for":[8,45,96],"intersection":[9,29,47],"types":[10,48],"was":[11,15],"introduced,":[12],"and":[13,30,49,118],"it":[14,71,130],"shown":[16,73],"that":[17,51,74,121],"the":[18,33,42,52,102,113,124,135],"bounded-dimensional":[19,46],"inhabitation":[20],"problem":[21,44,53,115],"is":[22,54,72,89,127,131],"decidable":[23,55],"under":[24],"non-idempotent":[26],"interpretation":[27],"undecidable":[31],"in":[32,56,123,132,134],"standard":[34],"set-theoretic":[35,125],"model.":[36,137],"In":[37,69],"this":[38],"paper":[39],"we":[40,106,119],"study":[41],"typability":[43,114,122],"prove":[50,120],"both":[57],"models.":[58],"We":[59],"establish":[60],"number":[62],"bounding":[64],"principles":[65],"depending":[66],"on":[67,77,86],"dimension.":[68],"particular,":[70],"dimensional":[75],"bound":[76],"derivations":[78],"gives":[79],"rise":[80],"to":[81,91,116],"bounded":[83,103],"width":[84,104],"property":[85,95,105],"types,":[87],"which":[88],"related":[90],"generalized":[93],"subformula":[94],"typings":[97],"arbitrary":[99],"terms.":[100],"Using":[101],"can":[107],"construct":[108],"nondeterministic":[110],"transformation":[111],"unification,":[117],"model":[126],"PSPACE-complete,":[128],"whereas":[129],"NP":[133],"multiset":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}