See Burali-Forti paradox in All languages combined, or Wiktionary
{ "etymology_text": "Named after Cesare Burali-Forti, who in 1897 published a paper proving a theorem which, unknown to him, contradicted a previously proved result by Georg Cantor.", "forms": [ { "form": "the Burali-Forti paradox", "tags": [ "canonical" ] } ], "head_templates": [ { "args": { "def": "1" }, "expansion": "the Burali-Forti paradox", "name": "en-prop" } ], "lang": "English", "lang_code": "en", "pos": "name", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Entries with translation boxes", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Set theory", "orig": "en:Set theory", "parents": [ "Mathematics", "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "text": "1984, Michael Hallett, Cantorian Set Theory and Limitation of Size, Oxford University Press (Clarendon Press), 1986, Paperback, page 186,\nLike them, Mirimanoff concentrates on the Burali-Forti paradox, and like Russell's analysis before, Mirimanoff shows how. in terms of size, the Burali-Forti paradox is basic and that if we solve this the other paradoxes will be solved too." }, { "text": "1994 [Routledge], Ivor Grattan-Guinness (editor), Companion Encyclopedia of the History and Philosophy of the Mathematical Sciences, Volume 1, 2003, Johns Hopkins University Press, Paperback, page 632,\nIn the first place, Berry rejected Russell's solution to the Burali-Forti paradox, claiming that it was easy to prove that the set of all ordinal numbers was a well-ordered set (and that Cantor had actually done it)." }, { "ref": "2002, Marcus Giaquinto, The Search for Certainty: A Philosophical Account of Foundations of Mathematics, Oxford University Press (Clarendon Press), page 37:", "text": "The Burali-Forti paradox was discovered by Cantor in 1895 and Burali-Forti in 1897, but was not regarded by them as a paradox.", "type": "quote" } ], "glosses": [ "The paradox that supposing the existence of a set of all ordinal numbers leads to a contradiction; construed as meaning that it is not a properly defined set." ], "id": "en-Burali-Forti_paradox-en-name-XXMWCsA3", "links": [ [ "set theory", "set theory" ], [ "set", "set" ], [ "ordinal number", "ordinal number" ] ], "raw_glosses": [ "(set theory) The paradox that supposing the existence of a set of all ordinal numbers leads to a contradiction; construed as meaning that it is not a properly defined set." ], "related": [ { "word": "Russell's paradox" } ], "synonyms": [ { "word": "Burali-Forti's paradox" } ], "topics": [ "mathematics", "sciences", "set-theory" ], "wikipedia": [ "Burali-Forti paradox", "Cesare Burali-Forti", "Georg Cantor" ] } ], "word": "Burali-Forti paradox" }
{ "etymology_text": "Named after Cesare Burali-Forti, who in 1897 published a paper proving a theorem which, unknown to him, contradicted a previously proved result by Georg Cantor.", "forms": [ { "form": "the Burali-Forti paradox", "tags": [ "canonical" ] } ], "head_templates": [ { "args": { "def": "1" }, "expansion": "the Burali-Forti paradox", "name": "en-prop" } ], "lang": "English", "lang_code": "en", "pos": "name", "related": [ { "word": "Russell's paradox" } ], "senses": [ { "categories": [ "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English proper nouns", "English terms with quotations", "English uncountable nouns", "Entries with translation boxes", "Pages with 1 entry", "Pages with entries", "en:Set theory" ], "examples": [ { "text": "1984, Michael Hallett, Cantorian Set Theory and Limitation of Size, Oxford University Press (Clarendon Press), 1986, Paperback, page 186,\nLike them, Mirimanoff concentrates on the Burali-Forti paradox, and like Russell's analysis before, Mirimanoff shows how. in terms of size, the Burali-Forti paradox is basic and that if we solve this the other paradoxes will be solved too." }, { "text": "1994 [Routledge], Ivor Grattan-Guinness (editor), Companion Encyclopedia of the History and Philosophy of the Mathematical Sciences, Volume 1, 2003, Johns Hopkins University Press, Paperback, page 632,\nIn the first place, Berry rejected Russell's solution to the Burali-Forti paradox, claiming that it was easy to prove that the set of all ordinal numbers was a well-ordered set (and that Cantor had actually done it)." }, { "ref": "2002, Marcus Giaquinto, The Search for Certainty: A Philosophical Account of Foundations of Mathematics, Oxford University Press (Clarendon Press), page 37:", "text": "The Burali-Forti paradox was discovered by Cantor in 1895 and Burali-Forti in 1897, but was not regarded by them as a paradox.", "type": "quote" } ], "glosses": [ "The paradox that supposing the existence of a set of all ordinal numbers leads to a contradiction; construed as meaning that it is not a properly defined set." ], "links": [ [ "set theory", "set theory" ], [ "set", "set" ], [ "ordinal number", "ordinal number" ] ], "raw_glosses": [ "(set theory) The paradox that supposing the existence of a set of all ordinal numbers leads to a contradiction; construed as meaning that it is not a properly defined set." ], "topics": [ "mathematics", "sciences", "set-theory" ], "wikipedia": [ "Burali-Forti paradox", "Cesare Burali-Forti", "Georg Cantor" ] } ], "synonyms": [ { "word": "Burali-Forti's paradox" } ], "word": "Burali-Forti paradox" }
Download raw JSONL data for Burali-Forti paradox meaning in English (2.6kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.