{"id":"https://openalex.org/W1927702085","doi":"https://doi.org/10.1215/00294527-3768177","title":"Computing the Number of Types of Infinite Length","display_name":"Computing the Number of Types of Infinite Length","publication_year":2016,"publication_date":"2016-11-25","ids":{"openalex":"https://openalex.org/W1927702085","doi":"https://doi.org/10.1215/00294527-3768177","mag":"1927702085"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-3768177","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-3768177","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-58/issue-1/Computing-the-Number-of-Types-of-Infinite-Length/10.1215/00294527-3768177.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-58/issue-1/Computing-the-Number-of-Types-of-Infinite-Length/10.1215/00294527-3768177.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Will Boney","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Will Boney","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7191,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7317713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"58","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.38029998540878296,"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.38029998540878296,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.2281000018119812,"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.057100001722574234,"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/subclass","display_name":"Subclass","score":0.7245000004768372},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.6588000059127808},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6365000009536743},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5857999920845032},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4350000023841858}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7462999820709229},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.7245000004768372},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.6588000059127808},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6365000009536743},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5857999920845032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5679000020027161},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49570000171661377},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4350000023841858},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.3531000018119812}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-3768177","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-3768177","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-58/issue-1/Computing-the-Number-of-Types-of-Infinite-Length/10.1215/00294527-3768177.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1309.4485","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.4485","pdf_url":"https://arxiv.org/pdf/1309.4485","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1480042820","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1480042820","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1215/00294527-3768177","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-3768177","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-58/issue-1/Computing-the-Number-of-Types-of-Infinite-Length/10.1215/00294527-3768177.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1927702085.pdf","grobid_xml":"https://content.openalex.org/works/W1927702085.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W360716942","https://openalex.org/W1953930525","https://openalex.org/W1976767604","https://openalex.org/W1978825183","https://openalex.org/W1983496318","https://openalex.org/W1989984537","https://openalex.org/W1990607394","https://openalex.org/W2000276324","https://openalex.org/W2049252038","https://openalex.org/W2080309222","https://openalex.org/W2087417826","https://openalex.org/W2097921472","https://openalex.org/W2100897181","https://openalex.org/W2963523306","https://openalex.org/W2963976658","https://openalex.org/W4211078531","https://openalex.org/W4231373458","https://openalex.org/W4231440310"],"related_works":[],"abstract_inverted_index":{"We":[0,36],"show":[1,37],"that":[2,38],"the":[3,19,24,27,66],"number":[4,20],"of":[5,7,9,11,21,26,61],"types":[6,63],"sequences":[8],"tuples":[10],"a":[12,59],"fixed":[13],"length":[14,25],"can":[15],"be":[16],"calculated":[17],"from":[18],"1-types":[22],"and":[23],"sequences.":[28],"Specifically,":[29],"if":[30],"\u03ba\u2264\u03bb,":[31],"then":[32],"sup":[33],"\u2016M\u2016=\u03bb|S\u03ba(M)|=(sup":[34],"\u2016M\u2016=\u03bb|S1(M)|)\u03ba.":[35],"this":[39],"holds":[40],"for":[41,53,64],"any":[42],"abstract":[43],"elementary":[44],"class":[45],"with":[46],"\u03bb-amalgamation.":[47],"No":[48],"such":[49],"calculation":[50],"is":[51],"possible":[52],"nonalgebraic":[54,62],"types.":[55],"However,":[56],"we":[57],"introduce":[58],"subclass":[60],"which":[65],"same":[67],"upper":[68],"bound":[69],"holds.":[70]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2016-06-24T00:00:00"}