{"id":"https://openalex.org/W1799652270","doi":"https://doi.org/10.1215/00294527-3132797","title":"Indiscernibles, EM-Types, and Ramsey Classes of Trees","display_name":"Indiscernibles, EM-Types, and Ramsey Classes of Trees","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1799652270","doi":"https://doi.org/10.1215/00294527-3132797","mag":"1799652270"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-3132797","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-3132797","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-3/Indiscernibles-EM-Types-and-Ramsey-Classes-of-Trees/10.1215/00294527-3132797.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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-3/Indiscernibles-EM-Types-and-Ramsey-Classes-of-Trees/10.1215/00294527-3132797.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lynn Scow","orcid":null},"institutions":[{"id":"https://openalex.org/I126820664","display_name":"Vassar College","ror":"https://ror.org/022x6qg61","country_code":"US","type":"education","lineage":["https://openalex.org/I126820664"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lynn Scow","raw_affiliation_strings":["Department of Mathematics Vassar College Poughkeepsie, New York 12604 USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Vassar College Poughkeepsie, New York 12604 USA","institution_ids":["https://openalex.org/I126820664"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126820664"],"apc_list":null,"apc_paid":null,"fwci":1.0826,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.74206349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"56","issue":"3","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.9014999866485596,"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.9014999866485596,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.04740000143647194,"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/T10126","display_name":"Logic, programming, and type systems","score":0.011099999770522118,"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/mathematical-proof","display_name":"Mathematical proof","score":0.800000011920929},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.7437999844551086},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6693999767303467},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.42570000886917114},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.335099995136261}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.800000011920929},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.7437999844551086},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6693999767303467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.65420001745224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5127000212669373},{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40880000591278076},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27129998803138733},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2590000033378601}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-3132797","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-3132797","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-3/Indiscernibles-EM-Types-and-Ramsey-Classes-of-Trees/10.1215/00294527-3132797.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:arXiv.org:1208.2991","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1208.2991","pdf_url":"https://arxiv.org/pdf/1208.2991","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1437570854","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1437570854","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-3132797","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-3132797","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-56/issue-3/Indiscernibles-EM-Types-and-Ramsey-Classes-of-Trees/10.1215/00294527-3132797.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/W1799652270.pdf","grobid_xml":"https://content.openalex.org/works/W1799652270.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W170839262","https://openalex.org/W1966465570","https://openalex.org/W1968276645","https://openalex.org/W1972476125","https://openalex.org/W2048613806","https://openalex.org/W2077904586","https://openalex.org/W2080438552","https://openalex.org/W2107539861","https://openalex.org/W2127133075","https://openalex.org/W2154492358","https://openalex.org/W2484259929","https://openalex.org/W2592546086","https://openalex.org/W2594827049","https://openalex.org/W4212984795","https://openalex.org/W4213347674","https://openalex.org/W4231373458","https://openalex.org/W4245310088"],"related_works":[],"abstract_inverted_index":{"The":[0],"author":[1],"has":[2],"previously":[3],"shown":[4],"that":[5,70],"for":[6],"a":[7,30,44],"certain":[8,71],"class":[9,37],"of":[10,27,38,59,73,85],"structures":[11,39,42,52],"I":[12,14,28],",":[13],"-indexed":[15],"indiscernible":[16],"sets":[17],"have":[18],"the":[19,25,83],"modeling":[20],"property":[21],"just":[22],"in":[23,43],"case":[24],"age":[26],"is":[29,64],"Ramsey":[31],"class.":[32],"We":[33],"expand":[34],"this":[35,79],"known":[36],"from":[40],"ordered":[41],"finite":[45,51],"relational":[46],"language":[47],"to":[48,66],"ordered,":[49],"locally":[50],"which":[53],"isolate":[54],"quantifier-free":[55,60],"types":[56],"by":[57],"way":[58],"formulas.":[61],"This":[62],"result":[63],"applied":[65],"give":[67],"new":[68],"proofs":[69],"classes":[72],"trees":[74],"are":[75],"Ramsey.":[76],"To":[77],"aid":[78],"project":[80],"we":[81],"develop":[82],"logic":[84],"EM-types.":[86]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-28T08:17:26.163206","created_date":"2016-06-24T00:00:00"}