{"id":"https://openalex.org/W4205097965","doi":"https://doi.org/10.1305/ndjfl/1093888400","title":"Hyperenumeration reducibility.","display_name":"Hyperenumeration reducibility.","publication_year":1978,"publication_date":"1978-07-01","ids":{"openalex":"https://openalex.org/W4205097965","doi":"https://doi.org/10.1305/ndjfl/1093888400"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093888400","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888400","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-3/Hyperenumeration-reducibility/10.1305/ndjfl/1093888400.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-19/issue-3/Hyperenumeration-reducibility/10.1305/ndjfl/1093888400.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050888128","display_name":"Luis E. Sanchis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luis E. Sanchis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050888128"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6192,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73196986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9035999774932861,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3570947051048279},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.346265971660614}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3570947051048279},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.346265971660614}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093888400","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888400","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-3/Hyperenumeration-reducibility/10.1305/ndjfl/1093888400.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/1093888400","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093888400","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/1093888400","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888400","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-3/Hyperenumeration-reducibility/10.1305/ndjfl/1093888400.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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4205097965.pdf","grobid_xml":"https://content.openalex.org/works/W4205097965.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W2037662783","https://openalex.org/W2060192729","https://openalex.org/W2069624526","https://openalex.org/W2905135108","https://openalex.org/W4232819959","https://openalex.org/W4243971812","https://openalex.org/W4251079669","https://openalex.org/W4253464784","https://openalex.org/W6653218484","https://openalex.org/W6656946646","https://openalex.org/W6667859020","https://openalex.org/W6671465371"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}