{"id":"https://openalex.org/W2149062436","doi":"https://doi.org/10.2178/jsl/1190150032","title":"A new \u201cfeasible\u201d arithmetic","display_name":"A new \u201cfeasible\u201d arithmetic","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W2149062436","doi":"https://doi.org/10.2178/jsl/1190150032","mag":"2149062436"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1190150032","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1190150032","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic 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/A5023976191","display_name":"Stephen J. Bellantoni","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen Bellantoni","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Canada, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Canada, E-mail:","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101917108","display_name":"Martin Hofmann","orcid":"https://orcid.org/0000-0002-6258-8255"},"institutions":[{"id":"https://openalex.org/I4210105224","display_name":"Foundation Scotland","ror":"https://ror.org/00x43vj55","country_code":"GB","type":"other","lineage":["https://openalex.org/I4210105224"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Hofmann","raw_affiliation_strings":["Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, Scotland, UK, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, Scotland, UK, E-mail:","institution_ids":["https://openalex.org/I4210105224","https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":2.6285,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91282816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"67","issue":"1","first_page":"104","last_page":"116"},"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.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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/mathematics","display_name":"Mathematics","score":0.638863205909729},{"id":"https://openalex.org/keywords/realizability","display_name":"Realizability","score":0.5982936024665833},{"id":"https://openalex.org/keywords/second-order-arithmetic","display_name":"Second-order arithmetic","score":0.5899521708488464},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5003468990325928},{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.49841856956481934},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.46704593300819397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3831004500389099},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.38085252046585083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2639264762401581},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18593981862068176}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.638863205909729},{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.5982936024665833},{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.5899521708488464},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5003468990325928},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.49841856956481934},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.46704593300819397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3831004500389099},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.38085252046585083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2639264762401581},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18593981862068176}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2178/jsl/1190150032","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1190150032","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1190150032","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1190150032","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W115501304","https://openalex.org/W636367345","https://openalex.org/W992186155","https://openalex.org/W1483568252","https://openalex.org/W1512931629","https://openalex.org/W1533996603","https://openalex.org/W1560272532","https://openalex.org/W1581416890","https://openalex.org/W1607926272","https://openalex.org/W1969548989","https://openalex.org/W1970629906","https://openalex.org/W1970869125","https://openalex.org/W1971256104","https://openalex.org/W1977396974","https://openalex.org/W1981528174","https://openalex.org/W1986998737","https://openalex.org/W2012968289","https://openalex.org/W2034895188","https://openalex.org/W2062740098","https://openalex.org/W2069549740","https://openalex.org/W2069792094","https://openalex.org/W2111324752","https://openalex.org/W2492590561","https://openalex.org/W2551720480","https://openalex.org/W2612444427","https://openalex.org/W2979259583","https://openalex.org/W4234514070","https://openalex.org/W4248733413","https://openalex.org/W6633520426","https://openalex.org/W6642834919"],"related_works":["https://openalex.org/W4255069280","https://openalex.org/W2951195380","https://openalex.org/W87599178","https://openalex.org/W2017398442","https://openalex.org/W1991956515","https://openalex.org/W4206411991","https://openalex.org/W4224937162","https://openalex.org/W2065703620","https://openalex.org/W2536088897","https://openalex.org/W1261060912"],"abstract_inverted_index":{"Abstract":[0],"A":[1,132,156],"classical":[2],"quantified":[3],"modal":[4,98],"logic":[5],"is":[6,29,37,55],"used":[7],"to":[8,49,60,96,102,128,140],"define":[9],"a":[10,34,80,103,142,153],"\u201cfeasible\u201d":[11],"arithmetic":[12],"whose":[13],"provably":[14],"total":[15],"functions":[16],"are":[17,119],"exactly":[18],"the":[19,45,89,93,130,146],"polynomial-time":[20],"computable":[21],"functions.":[22,86],"Informally,":[23],"one":[24,91,127],"understands":[25],"\u20de\u221d":[26],"as":[27,38,40],"\u201c\u221d":[28],"feasibly":[30],"demonstrable\u201d.":[31],"differs":[32],"from":[33],"system":[35,76],"that":[36,116],"powerful":[39],"Peano":[41],"Arithmetic":[42],"only":[43,79],"by":[44],"restriction":[46],"of":[47,72,84],"induction":[48,65,117],"ontic":[50],"(i.e.,":[51],"\u20de-free)":[52],"formulas.":[53],"Thus,":[54],"defined":[56],"without":[57],"any":[58],"reference":[59],"bounding":[61],"terms,":[62],"and":[63],"admitting":[64],"over":[66],"formulas":[67,118],"having":[68],"arbitrarily":[69],"many":[70],"alternations":[71],"unbounded":[73],"quantifiers.":[74],"The":[75,114,135],"also":[77,137],"uses":[78],"very":[81],"small":[82],"set":[83],"initial":[85],"To":[87],"obtain":[88],"characterization,":[90],"extends":[92],"Curry-Howard":[94],"isomorphism":[95],"include":[97],"operations.":[99],"This":[100],"leads":[101,138],"realizability":[104],"translation":[105,133],"based":[106],"on":[107],"recent":[108],"results":[109],"in":[110,122],"higher-type":[111],"ramified":[112],"recursion.":[113],"fact":[115],"not":[120],"restricted":[121],"their":[123],"logical":[124],"complexity,":[125],"allows":[126],"use":[129],"Friedman":[131],"directly.":[134],"development":[136],"us":[139],"propose":[141],"new":[143,160],"Frege":[144],"rule,":[145],"\u201cModal":[147],"Extension\u201d":[148],"rule:":[149],"if":[150],"\u22a2":[151,155],"\u221d":[152,158],"then":[154],"\u2194":[157],"for":[159],"symbol":[161],"A.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}