{"id":"https://openalex.org/W2038389784","doi":"https://doi.org/10.1305/ndjfl/1054837937","title":"A Note on Recursive Models of Set Theories","display_name":"A Note on Recursive Models of Set Theories","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W2038389784","doi":"https://doi.org/10.1305/ndjfl/1054837937","mag":"2038389784"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1054837937","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1054837937","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-42/issue-2/A-Note-on-Recursive-Models-of-Set-Theories/10.1305/ndjfl/1054837937.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-42/issue-2/A-Note-on-Recursive-Models-of-Set-Theories/10.1305/ndjfl/1054837937.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026827166","display_name":"Antonella Mancini","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Antonella Mancini","raw_affiliation_strings":["University of Notre Dame"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027169167","display_name":"Domenico Zambella","orcid":"https://orcid.org/0000-0003-1141-2898"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Domenico Zambella","raw_affiliation_strings":["University of Notre Dame"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.11157692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"42","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.7494999766349792,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.7494999766349792,"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/T13051","display_name":"Qualitative Comparative Analysis Research","score":0.7077000141143799,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13963","display_name":"Organizational Management and Leadership","score":0.6948000192642212,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6278026103973389},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6182919144630432},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5860030651092529},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.5057199001312256},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.4711151123046875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40331852436065674},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33076751232147217},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2611652910709381},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.24698075652122498},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05217820405960083}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6278026103973389},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6182919144630432},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5860030651092529},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.5057199001312256},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.4711151123046875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40331852436065674},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33076751232147217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2611652910709381},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.24698075652122498},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05217820405960083},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1054837937","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1054837937","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-42/issue-2/A-Note-on-Recursive-Models-of-Set-Theories/10.1305/ndjfl/1054837937.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/1054837937","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1054837937","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/1054837937","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1054837937","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-42/issue-2/A-Note-on-Recursive-Models-of-Set-Theories/10.1305/ndjfl/1054837937.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":[{"score":0.5299999713897705,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2038389784.pdf","grobid_xml":"https://content.openalex.org/works/W2038389784.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1558325643","https://openalex.org/W1982001540","https://openalex.org/W2068893742","https://openalex.org/W2075123663","https://openalex.org/W2130130973"],"related_works":["https://openalex.org/W2366107444","https://openalex.org/W4388145910","https://openalex.org/W1976205134","https://openalex.org/W2381570729","https://openalex.org/W4248336175","https://openalex.org/W3009369890","https://openalex.org/W2031260042","https://openalex.org/W2391445434","https://openalex.org/W4312490297","https://openalex.org/W2185713319"],"abstract_inverted_index":{"We":[0,10],"construct":[1],"two":[2],"recursive":[3,29],"models":[4,30],"of":[5,7,16,35],"fragments":[6,15],"set":[8,18],"theory.":[9],"also":[11],"show":[12],"that":[13,20],"the":[14,32,36],"Kripke-Platek":[17],"theory":[19],"prove":[21],"$":[22,25],"\\varepsilon$-induction":[23],"for":[24],"\\Sigma_1$-formulas":[26],"have":[27],"no":[28],"but":[31],"standard":[33],"model":[34],"hereditarily":[37],"finite":[38],"sets.":[39]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}