{"id":"https://openalex.org/W2807548813","doi":"https://doi.org/10.2178/jsl.7804070","title":"Mad Families Constructed from Perfect Almost Disjoint Families","display_name":"Mad Families Constructed from Perfect Almost Disjoint Families","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2807548813","doi":"https://doi.org/10.2178/jsl.7804070","mag":"2807548813"},"language":"en","primary_location":{"id":"doi:10.2178/jsl.7804070","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl.7804070","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Symbolic 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/A5070977261","display_name":"J\u00f6rg Brendle","orcid":"https://orcid.org/0000-0001-8120-2883"},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"J\u00f6rg Brendle","raw_affiliation_strings":["Graduate School of System Informatics, Kobe University, Rokko-Dai 1-1, NADA, Kobe 657-8501, Japan, E-mail:","Graduate School of System Informatics, Kobe University, Rokko-Dai 1-1, NADA, Kobe 657-8501, Japan, E-mail: brendle@kurt.scitec.kobe-u.ac.jp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of System Informatics, Kobe University, Rokko-Dai 1-1, NADA, Kobe 657-8501, Japan, E-mail:","institution_ids":["https://openalex.org/I65837984"]},{"raw_affiliation_string":"Graduate School of System Informatics, Kobe University, Rokko-Dai 1-1, NADA, Kobe 657-8501, Japan, E-mail: brendle@kurt.scitec.kobe-u.ac.jp","institution_ids":["https://openalex.org/I65837984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087796165","display_name":"Yurii Khomskii","orcid":"https://orcid.org/0000-0002-1763-876X"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Yurii Khomskii","raw_affiliation_strings":["Kurt G\u00f6del Research Center for Mathematical Logic, University of Vienna, W\u00e4hringer Stra\u00dfe 25, 1090 Wien, Austria, E-mail:","Kurt G\u00f6del Research Center for Mathematical Logic, University of Vienna, W\u00e4hringer Stra\u00dfe 25, 1090 Wien, Austria, E-mail: yurii@deds.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kurt G\u00f6del Research Center for Mathematical Logic, University of Vienna, W\u00e4hringer Stra\u00dfe 25, 1090 Wien, Austria, E-mail:","institution_ids":["https://openalex.org/I129774422"]},{"raw_affiliation_string":"Kurt G\u00f6del Research Center for Mathematical Logic, University of Vienna, W\u00e4hringer Stra\u00dfe 25, 1090 Wien, Austria, E-mail: yurii@deds.nl","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3152,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81427106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"78","issue":"4","first_page":"1164","last_page":"1180"},"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.9998000264167786,"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.9998000264167786,"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.9617000222206116,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9379000067710876,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8589967489242554},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.752269446849823},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7381865978240967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5955531597137451},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5579958558082581},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5179842710494995},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5117669105529785},{"id":"https://openalex.org/keywords/family-of-sets","display_name":"Family of sets","score":0.5053663849830627},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48564445972442627},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.4708024263381958},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2774850130081177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07581892609596252}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8589967489242554},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.752269446849823},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7381865978240967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5955531597137451},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5579958558082581},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5179842710494995},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5117669105529785},{"id":"https://openalex.org/C150591576","wikidata":"https://www.wikidata.org/wiki/Q739925","display_name":"Family of sets","level":3,"score":0.5053663849830627},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48564445972442627},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4708024263381958},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2774850130081177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07581892609596252},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2178/jsl.7804070","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl.7804070","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1388953998","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1388953998","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","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1972178749","https://openalex.org/W1974828116","https://openalex.org/W2002872429","https://openalex.org/W2013432018","https://openalex.org/W2019842136","https://openalex.org/W2022460137","https://openalex.org/W2107904426","https://openalex.org/W2108070451","https://openalex.org/W2138117894","https://openalex.org/W6645578974","https://openalex.org/W6807762989","https://openalex.org/W7039185251"],"related_works":["https://openalex.org/W2052907214","https://openalex.org/W990556692","https://openalex.org/W4313644288","https://openalex.org/W2065355983","https://openalex.org/W2963074859","https://openalex.org/W1981951275","https://openalex.org/W2068865948","https://openalex.org/W2022054586","https://openalex.org/W2092044446","https://openalex.org/W2098284475"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"the":[3,8,28,54,69,76,92],"consistency":[4,93],"of":[5,10,43,79,94],"together":[6],"with":[7],"existence":[9],"a":[11,16,32,65,86],"-definable":[12],"mad":[13,33,52,87],"family,":[14],"answering":[15],"question":[17],"posed":[18],"by":[19],"Friedman":[20],"and":[21],"Zdomskyy":[22],"in":[23,35,53],"[7,":[24],"Question":[25],"16].":[26],"For":[27],"proof":[29,90],"we":[30],"construct":[31],"family":[34],"L":[36],"which":[37],"is":[38,85],"an":[39],"\u2135":[40],"1":[41],"-union":[42],"perfect":[44],"a.d.":[45,81],"sets,":[46],"such":[47],"that":[48],"this":[49],"union":[50,84],"remains":[51],"iterated":[55],"Hechler":[56],"extension.":[57],"The":[58],"construction":[59],"also":[60],"leads":[61],"us":[62],"to":[63],"isolate":[64],"new":[66],"cardinal":[67],"invariant,":[68],"Borel":[70,80],"almost-disjointness":[71],"number":[72,78],",":[73],"defined":[74],"as":[75],"least":[77],"sets":[82],"whose":[83],"family.":[88],"Our":[89],"yields":[91],"(and":[95],"hence,":[96],").":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}