{"id":"https://openalex.org/W2950241008","doi":"https://doi.org/10.1215/00294527-2007-001","title":"Self-Embeddings of Computable Trees","display_name":"Self-Embeddings of Computable Trees","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2950241008","doi":"https://doi.org/10.1215/00294527-2007-001","mag":"2950241008"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2007-001","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2007-001","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-49/issue-1/Self-Embeddings-of-Computable-Trees/10.1215/00294527-2007-001.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-49/issue-1/Self-Embeddings-of-Computable-Trees/10.1215/00294527-2007-001.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082626598","display_name":"Stephen Binns","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen Binns","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004729046","display_name":"Bj\u00f8rn Kjos-Hanssen","orcid":"https://orcid.org/0000-0002-6199-1755"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bj\u00f8rn Kjos-Hanssen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091904171","display_name":"Manuel Lerman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manuel Lerman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091663311","display_name":"James H. Schmerl","orcid":"https://orcid.org/0000-0003-0545-8339"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James H. Schmerl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072805118","display_name":"Reed Solomon","orcid":"https://orcid.org/0000-0001-7574-204X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reed Solomon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8279,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78452517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"49","issue":"1","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":1.0,"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":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.9700000286102295,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9679999947547913,"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/antichain","display_name":"Antichain","score":0.9158304333686829},{"id":"https://openalex.org/keywords/computable-number","display_name":"Computable number","score":0.7628335952758789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7384626865386963},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7074546217918396},{"id":"https://openalex.org/keywords/reverse-mathematics","display_name":"Reverse mathematics","score":0.580891489982605},{"id":"https://openalex.org/keywords/computable-analysis","display_name":"Computable analysis","score":0.5584852695465088},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4952789843082428},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4864513576030731},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.48374509811401367},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4682430028915405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44034045934677124},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42726463079452515},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.24954655766487122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15820041298866272}],"concepts":[{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.9158304333686829},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.7628335952758789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7384626865386963},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7074546217918396},{"id":"https://openalex.org/C127753061","wikidata":"https://www.wikidata.org/wiki/Q2005236","display_name":"Reverse mathematics","level":3,"score":0.580891489982605},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.5584852695465088},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4952789843082428},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4864513576030731},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.48374509811401367},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4682430028915405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44034045934677124},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42726463079452515},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.24954655766487122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15820041298866272},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1215/00294527-2007-001","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2007-001","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-49/issue-1/Self-Embeddings-of-Computable-Trees/10.1215/00294527-2007-001.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:CiteSeerX.psu:10.1.1.364.9253","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.9253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uconn.edu/~solomon/research/selftrees.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.531.9557","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.531.9557","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.kfupm.edu.sa/MATH/binns/binns_etal491Pfinal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.759.18","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.759.18","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1408.2286.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1215/00294527-2007-001","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2007-001","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-49/issue-1/Self-Embeddings-of-Computable-Trees/10.1215/00294527-2007-001.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":[{"id":"https://openalex.org/G2707157426","display_name":"Computability Theory, Reverse Mathematics and Countable Algebraic Structures","funder_award_id":"0400754","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2950241008.pdf","grobid_xml":"https://content.openalex.org/works/W2950241008.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1500105827","https://openalex.org/W1554860413","https://openalex.org/W1556453281","https://openalex.org/W1985409003","https://openalex.org/W2008739843","https://openalex.org/W2027559165","https://openalex.org/W2056414301","https://openalex.org/W2084666877","https://openalex.org/W2097686156","https://openalex.org/W2113879370","https://openalex.org/W2142840306","https://openalex.org/W2334667341","https://openalex.org/W2502130873","https://openalex.org/W4232277851","https://openalex.org/W4240833632","https://openalex.org/W4246804796"],"related_works":["https://openalex.org/W197714092","https://openalex.org/W1577501449","https://openalex.org/W2150482238","https://openalex.org/W2527631632","https://openalex.org/W1994403863","https://openalex.org/W153068418","https://openalex.org/W2950241008","https://openalex.org/W4300722755","https://openalex.org/W4225581716","https://openalex.org/W4221167692"],"abstract_inverted_index":{"We":[0,55],"divide":[1],"the":[2,12,24,42,82],"class":[3],"of":[4,44,47,84],"infinite":[5,48,59,66,71],"computable":[6,49,60,67],"trees":[7,50],"into":[8],"three":[9],"types.":[10],"For":[11],"first":[13],"and":[14,36,78],"second":[15],"types,":[16],"0'":[17],"computes":[18,28],"a":[19,29],"nontrivial":[20,30,45],"self-embedding":[21],"while":[22],"for":[23],"third":[25],"type":[26],"0''":[27],"self-embedding.":[31],"These":[32],"results":[33,40],"are":[34],"optimal":[35,77],"we":[37],"obtain":[38],"partial":[39],"concerning":[41],"complexity":[43],"self-embeddings":[46],"considered":[51],"up":[52],"to":[53,81],"isomorphism.":[54],"show":[56],"that":[57],"every":[58],"tree":[61],"must":[62],"have":[63],"either":[64],"an":[65,70],"chain":[68],"or":[69],"\u03a001":[72],"antichain.":[73],"This":[74],"result":[75],"is":[76],"has":[79],"connections":[80],"program":[83],"reverse":[85],"mathematics.":[86]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}