{"id":"https://openalex.org/W2020517911","doi":"https://doi.org/10.1305/ndjfl/1093891109","title":"A stronger theorem concerning the non-existence of combinatorial designs on infinite sets.","display_name":"A stronger theorem concerning the non-existence of combinatorial designs on infinite sets.","publication_year":1973,"publication_date":"1973-10-01","ids":{"openalex":"https://openalex.org/W2020517911","doi":"https://doi.org/10.1305/ndjfl/1093891109","mag":"2020517911"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093891109","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093891109","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059091417","display_name":"William J. Frascella","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"William J. Frascella","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5059091417"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16046856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9176999926567078,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9176999926567078,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5785418748855591},{"id":"https://openalex.org/keywords/combinatorial-principles","display_name":"Combinatorial principles","score":0.4797969162464142},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4361318349838257},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36025166511535645},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.11378470063209534}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5785418748855591},{"id":"https://openalex.org/C1769372","wikidata":"https://www.wikidata.org/wiki/Q3850844","display_name":"Combinatorial principles","level":3,"score":0.4797969162464142},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4361318349838257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36025166511535645},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.11378470063209534}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093891109","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093891109","pdf_url":null,"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/1093891109","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093891109","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":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1990550398","https://openalex.org/W2073994679"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"The":[0],"aim":[1],"of":[2,38,46,49,63],"the":[3,22,44],"present":[4],"paper":[5],"is":[6,26,43,58],"to":[7],"show":[8],"that":[9],"certain":[10],"combinatorial":[11],"designs":[12],"on":[13],"infinite":[14],"sets":[15],"cannot":[16],"exist.To":[17],"be":[18],"precise":[19],"we":[20],"introduce":[21],"following":[23],"terminology.If":[24],"M":[25,50,64],"a":[27,31,60],"set":[28],"and":[29,66,74,80],"p":[30],"cardinal":[32,36],"number":[33,37],"-M":[34],"(the":[35],"M)":[39],"then":[40],"[M]":[41,72],"P":[42,73],"collection":[45],"all":[47],"subsets":[48],"having":[51],"cardinality":[52],"p.":[53],"Definition":[54],"1.A":[55],"family":[56,62],"F":[57,70,79],"called":[59],"p-tuple":[61],"if":[65,68],"only":[67],"(i)":[69],"c":[71,82],"(ii)":[75],"x,":[76],"y":[77,83],"e":[78],"x":[81,85],"implies":[84],"=":[86],"y.":[87]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}