{"id":"https://openalex.org/W2005490762","doi":"https://doi.org/10.1305/ndjfl/1040046141","title":"Infinite Versions of Some Problems from Finite Complexity Theory","display_name":"Infinite Versions of Some Problems from Finite Complexity Theory","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2005490762","doi":"https://doi.org/10.1305/ndjfl/1040046141","mag":"2005490762"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1040046141","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040046141","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-37/issue-4/Infinite-Versions-of-Some-Problems-from-Finite-Complexity-Theory/10.1305/ndjfl/1040046141.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":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-37/issue-4/Infinite-Versions-of-Some-Problems-from-Finite-Complexity-Theory/10.1305/ndjfl/1040046141.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064590936","display_name":"Jeffry L. Hirst","orcid":"https://orcid.org/0000-0002-8273-8951"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]},{"id":"https://openalex.org/I430192","display_name":"Appalachian State University","ror":"https://ror.org/051m4vc48","country_code":"US","type":"education","lineage":["https://openalex.org/I430192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffry L. Hirst","raw_affiliation_strings":["Department of Mathematical Sciences Appalachian State University Boone , NC 28608","Department of Mathematics University of Wisconsin Madison , WI 53706-1388"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences Appalachian State University Boone , NC 28608","institution_ids":["https://openalex.org/I430192"]},{"raw_affiliation_string":"Department of Mathematics University of Wisconsin Madison , WI 53706-1388","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032435178","display_name":"Steffen Lempp","orcid":"https://orcid.org/0000-0002-2958-4017"},"institutions":[{"id":"https://openalex.org/I430192","display_name":"Appalachian State University","ror":"https://ror.org/051m4vc48","country_code":"US","type":"education","lineage":["https://openalex.org/I430192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steffen Lempp","raw_affiliation_strings":["Department of Mathematical Sciences Appalachian State University Boone , NC 28608"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences Appalachian State University Boone , NC 28608","institution_ids":["https://openalex.org/I430192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.13461152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"37","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/recursion","display_name":"Recursion (computer science)","score":0.6971993446350098},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6537156105041504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5767343044281006},{"id":"https://openalex.org/keywords/categorization","display_name":"Categorization","score":0.49397164583206177},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4672567546367645},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.4456534683704376},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4214920699596405},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.42011559009552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36824196577072144},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.35369324684143066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3289825916290283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3179091811180115},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.27997922897338867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2304023802280426},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11419758200645447}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6971993446350098},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6537156105041504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5767343044281006},{"id":"https://openalex.org/C94124525","wikidata":"https://www.wikidata.org/wiki/Q912550","display_name":"Categorization","level":2,"score":0.49397164583206177},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4672567546367645},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.4456534683704376},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4214920699596405},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.42011559009552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36824196577072144},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35369324684143066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3289825916290283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3179091811180115},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.27997922897338867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2304023802280426},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11419758200645447},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1040046141","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040046141","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-37/issue-4/Infinite-Versions-of-Some-Problems-from-Finite-Complexity-Theory/10.1305/ndjfl/1040046141.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:CULeuclid:euclid.ndjfl/1040046141","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1040046141","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.1305/ndjfl/1040046141","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040046141","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-37/issue-4/Infinite-Versions-of-Some-Problems-from-Finite-Complexity-Theory/10.1305/ndjfl/1040046141.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":[{"id":"https://openalex.org/G1127925059","display_name":"Mathematical Sciences: Recursion Theory","funder_award_id":"9100114","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2005490762.pdf","grobid_xml":"https://content.openalex.org/works/W2005490762.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1522998756","https://openalex.org/W1975442866","https://openalex.org/W1984103222","https://openalex.org/W2024551482","https://openalex.org/W2036265926","https://openalex.org/W2051095001","https://openalex.org/W2056414301","https://openalex.org/W2067489791","https://openalex.org/W2098604425","https://openalex.org/W2106260240","https://openalex.org/W2401610261","https://openalex.org/W2952286083","https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2041069649","https://openalex.org/W342214647","https://openalex.org/W2461808546","https://openalex.org/W2047754121","https://openalex.org/W2990853482","https://openalex.org/W2295040078","https://openalex.org/W1548964214","https://openalex.org/W2045590835"],"abstract_inverted_index":{"Recently,":[0],"several":[1,31],"authors":[2],"have":[3],"explored":[4],"the":[5,14],"connections":[6],"between":[7],"NP-complete":[8],"problems":[9,32],"for":[10,19],"finite":[11,35],"objects":[12],"and":[13,45],"complexity":[15,36,44],"of":[16,30,40,57],"their":[17,41],"analogs":[18,51],"infinite":[20,28,50],"objects.":[21],"In":[22],"this":[23],"paper,":[24],"we":[25],"will":[26],"categorize":[27],"versions":[29],"arising":[33],"from":[34],"theory":[37],"in":[38,54],"terms":[39],"recursion":[42],"theoretic":[43,47],"proof":[46],"strength.":[48],"These":[49],"can":[52],"behave":[53],"a":[55],"variety":[56],"unexpected":[58],"ways.":[59]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}