{"id":"https://openalex.org/W2955679399","doi":"https://doi.org/10.1215/00294527-2019-0013","title":"A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic","display_name":"A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic","publication_year":2019,"publication_date":"2019-07-04","ids":{"openalex":"https://openalex.org/W2955679399","doi":"https://doi.org/10.1215/00294527-2019-0013","mag":"2955679399"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2019-0013","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-2019-0013","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030545131","display_name":"Mohammad Ardeshir","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mohammad Ardeshir","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077063223","display_name":"Erfan Khaniki","orcid":"https://orcid.org/0000-0002-5843-7315"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erfan Khaniki","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064199429","display_name":"Mohsen Shahriari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohsen Shahriari","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030545131"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10263614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"60","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9932000041007996,"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.9922000169754028,"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/counterexample","display_name":"Counterexample","score":0.9115723371505737},{"id":"https://openalex.org/keywords/realizability","display_name":"Realizability","score":0.9055217504501343},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.7345982193946838},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5711448788642883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5289556980133057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44576725363731384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41041770577430725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2273036539554596}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.9115723371505737},{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.9055217504501343},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.7345982193946838},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5711448788642883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5289556980133057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44576725363731384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41041770577430725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2273036539554596},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1215/00294527-2019-0013","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-2019-0013","pdf_url":null,"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/1562205626","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1562205626","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1989457091","https://openalex.org/W1997250390","https://openalex.org/W2039781369","https://openalex.org/W2086177561","https://openalex.org/W2171341762"],"related_works":["https://openalex.org/W2056396420","https://openalex.org/W2502180613","https://openalex.org/W2153599441","https://openalex.org/W2955679399","https://openalex.org/W1997250390","https://openalex.org/W200878617","https://openalex.org/W4298841586","https://openalex.org/W2952531188","https://openalex.org/W1597578789","https://openalex.org/W1989746243"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,16],"counterexample":[3],"to":[4],"the":[5],"claim":[6],"that":[7],"every":[8],"provably":[9],"total":[10],"function":[11],"of":[12],"Basic":[13],"Arithmetic":[14],"is":[15],"polynomially":[17],"bounded":[18],"primitive":[19],"recursive":[20],"function.":[21]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}