{"id":"https://openalex.org/W2078719364","doi":"https://doi.org/10.1215/00294527-2835101","title":"Rudimentary Recursion, Gentle Functions and Provident Sets","display_name":"Rudimentary Recursion, Gentle Functions and Provident Sets","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2078719364","doi":"https://doi.org/10.1215/00294527-2835101","mag":"2078719364"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2835101","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2835101","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-1/Rudimentary-Recursion-Gentle-Functions-and-Provident-Sets/10.1215/00294527-2835101.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-56/issue-1/Rudimentary-Recursion-Gentle-Functions-and-Provident-Sets/10.1215/00294527-2835101.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114010753","display_name":"A. R. D. Mathias","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. R. D. Mathias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5105417163","display_name":"N. J. Bowler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. J. Bowler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0923,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.905253,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"56","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9894000291824341,"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.7514356970787048},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.7259217500686646},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6753743290901184},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5955467224121094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.56150221824646},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5514541268348694},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5041073560714722},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.473642498254776},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4684230089187622},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.4375230669975281},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.4236445426940918},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4022662341594696},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3471429944038391},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3085689842700958},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2267095446586609},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21363452076911926},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18097862601280212}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7514356970787048},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7259217500686646},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6753743290901184},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5955467224121094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56150221824646},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5514541268348694},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5041073560714722},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.473642498254776},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4684230089187622},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.4375230669975281},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.4236445426940918},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4022662341594696},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3471429944038391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3085689842700958},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2267095446586609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21363452076911926},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18097862601280212},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1215/00294527-2835101","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2835101","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-1/Rudimentary-Recursion-Gentle-Functions-and-Provident-Sets/10.1215/00294527-2835101.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/1427202973","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1427202973","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-2835101","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2835101","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-1/Rudimentary-Recursion-Gentle-Functions-and-Provident-Sets/10.1215/00294527-2835101.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/W2078719364.pdf","grobid_xml":"https://content.openalex.org/works/W2078719364.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1539794912","https://openalex.org/W1973632985","https://openalex.org/W2056715322","https://openalex.org/W2079915797","https://openalex.org/W2091425612","https://openalex.org/W2114727102","https://openalex.org/W2147943046","https://openalex.org/W2330980320","https://openalex.org/W4213012687","https://openalex.org/W4234245490","https://openalex.org/W4247372698","https://openalex.org/W4248056908","https://openalex.org/W4248655848","https://openalex.org/W4299370978","https://openalex.org/W4299525159"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W1499233953","https://openalex.org/W1982015164","https://openalex.org/W203725150","https://openalex.org/W2349651113"],"abstract_inverted_index":{"This":[0],"paper,":[1],"a":[2,55,96,106,110],"contribution":[3],"to":[4,42,136],"\u201cmicro":[5],"set":[6,94],"theory\u201d,":[7],"is":[8,62,87,113,126,150],"the":[9,13,25,29,35,44,103,114,139,144],"study":[10,45],"promised":[11],"by":[12,22,109],"first":[14],"author":[15],"in":[16,81,101,138],"[M4],":[17],"as":[18,70],"improved":[19],"and":[20,34,74,99],"extended":[21],"work":[23],"of":[24,39,46,53,57,105,117,121,124],"second.":[26],"We":[27],"use":[28],"rudimentarily":[30],"recursive":[31],"(set-theoretic)":[32],"functions":[33,41],"slightly":[36],"larger":[37],"collection":[38],"gentle":[40],"initiate":[43],"provident":[47,97,107,115],"sets,":[48],"which":[49],"are":[50],"transitive":[51,72],"models":[52,123],"PROVI,":[54],"subsystem":[56],"KP":[58],"whose":[59],"minimal":[60],"model":[61],"Jensen\u2019s":[63],"J\u03c9.":[64],"PROVI":[65],"supports":[66],"familiar":[67],"definitions,":[68],"such":[69],"rank,":[71],"closure":[73,116],"ordinal":[75,78],"addition\u2014though":[76],"not":[77],"multiplication\u2014and":[79],"(shown":[80,100],"[M8])":[82,102],"Shoenfield\u2019s":[83],"unramified":[84],"forcing.":[85],"Providence":[86],"preserved":[88],"under":[89],"directed":[90],"unions.":[91],"An":[92],"arbitrary":[93],"has":[95],"closure,":[98],"extension":[104],"M":[108],"set-generic":[111],"G":[112],"M\u222a{G}.":[118],"The":[119,128],"improvidence":[120],"many":[122],"Z":[125],"shown.":[127],"final":[129],"section":[130],"uses":[131],"similar":[132],"but":[133],"simpler":[134],"recursions":[135],"show,":[137],"weak":[140],"system":[141],"MW,":[142],"that":[143],"truth":[145],"predicate":[146],"for":[147],"\u0394\u02d90":[148],"formul\u00e6":[149],"\u03941.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}