{"id":"https://openalex.org/W2038625855","doi":"https://doi.org/10.1215/00294527-2009-009","title":"Finitary Set Theory","display_name":"Finitary Set Theory","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2038625855","doi":"https://doi.org/10.1215/00294527-2009-009","mag":"2038625855"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2009-009","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2009-009","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-3/Finitary-Set-Theory/10.1215/00294527-2009-009.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-50/issue-3/Finitary-Set-Theory/10.1215/00294527-2009-009.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091026291","display_name":"Laurence Kirby","orcid":"https://orcid.org/0000-0001-9258-7694"},"institutions":[{"id":"https://openalex.org/I141810926","display_name":"Baruch College","ror":"https://ror.org/023qavy03","country_code":"US","type":"education","lineage":["https://openalex.org/I141810926"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Laurence Kirby","raw_affiliation_strings":["Bernard Baruch Way New York NY 10010 USA","Department of Mathematics Baruch College, City University of New York"],"affiliations":[{"raw_affiliation_string":"Bernard Baruch Way New York NY 10010 USA","institution_ids":["https://openalex.org/I141810926"]},{"raw_affiliation_string":"Department of Mathematics Baruch College, City University of New York","institution_ids":["https://openalex.org/I141810926"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091026291"],"corresponding_institution_ids":["https://openalex.org/I141810926"],"apc_list":null,"apc_paid":null,"fwci":0.6856,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.69986319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"50","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.9995999932289124,"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.9995999932289124,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9878000020980835,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9868000149726868,"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/finitary","display_name":"Finitary","score":0.9780069589614868},{"id":"https://openalex.org/keywords/adjunction","display_name":"Adjunction","score":0.6829633116722107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6474354267120361},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5461890697479248},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5329815745353699},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5101540684700012},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4658554196357727},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.44581955671310425},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.44279298186302185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4024418890476227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27954530715942383},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2792580723762512},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0895611047744751}],"concepts":[{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.9780069589614868},{"id":"https://openalex.org/C2780580338","wikidata":"https://www.wikidata.org/wiki/Q577835","display_name":"Adjunction","level":2,"score":0.6829633116722107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6474354267120361},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5461890697479248},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5329815745353699},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5101540684700012},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4658554196357727},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.44581955671310425},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.44279298186302185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4024418890476227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27954530715942383},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2792580723762512},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0895611047744751},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1215/00294527-2009-009","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2009-009","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-3/Finitary-Set-Theory/10.1215/00294527-2009-009.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/1257862036","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1257862036","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-2009-009","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2009-009","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-50/issue-3/Finitary-Set-Theory/10.1215/00294527-2009-009.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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2038625855.pdf","grobid_xml":"https://content.openalex.org/works/W2038625855.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W13300039","https://openalex.org/W192540218","https://openalex.org/W1493890316","https://openalex.org/W1549237291","https://openalex.org/W1964486910","https://openalex.org/W1971643033","https://openalex.org/W1997677910","https://openalex.org/W2006451332","https://openalex.org/W2007983321","https://openalex.org/W2008055057","https://openalex.org/W2018944629","https://openalex.org/W2057897097","https://openalex.org/W2073229248","https://openalex.org/W2074448200","https://openalex.org/W2077162222","https://openalex.org/W2082844773","https://openalex.org/W2094244132","https://openalex.org/W2129063902","https://openalex.org/W2130471901","https://openalex.org/W4232166111","https://openalex.org/W4234245490","https://openalex.org/W4239501142"],"related_works":["https://openalex.org/W2976590292","https://openalex.org/W4288102793","https://openalex.org/W4206837156","https://openalex.org/W2975654559","https://openalex.org/W2085314983","https://openalex.org/W2017288906","https://openalex.org/W2075406361","https://openalex.org/W4391047045","https://openalex.org/W2038625855","https://openalex.org/W4388432515"],"abstract_inverted_index":{"I":[0],"argue":[1],"for":[2,21,32],"the":[3,6,33,50],"use":[4],"of":[5,36,49,63],"adjunction":[7],"operator":[8],"(adding":[9],"a":[10,19,23,29,46,59],"single":[11],"new":[12],"element":[13],"to":[14,58],"an":[15,42],"existing":[16],"set)":[17],"as":[18],"basis":[20],"building":[22],"finitary":[24],"set":[25,53],"theory.":[26],"It":[27],"allows":[28],"simplified":[30],"axiomatization":[31],"first-order":[34],"theory":[35],"hereditarily":[37],"finite":[38,67],"sets":[39],"based":[40],"on":[41,66],"induction":[43],"schema":[44],"and":[45],"rigorous":[47],"characterization":[48],"primitive":[51,60],"recursive":[52,61],"functions.":[54],"The":[55],"latter":[56],"leads":[57],"presentation":[62],"arithmetical":[64],"operations":[65],"sets.":[68]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}