See ZF in All languages combined, or Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "ZF (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"alt_of": [
{
"extra": "(set theory): a particular axiomatic formulation of set theory without the axiom of choice",
"word": "Zermelo-Fraenkel"
}
],
"categories": [
{
"kind": "other",
"name": "English links with redundant wikilinks",
"parents": [
"Links with redundant wikilinks",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Set theory",
"orig": "en:Set theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "35 65",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "24 76",
"kind": "other",
"name": "Pages with 3 entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "22 78",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "1967, Carol Karp, “A Proof of the Relative Consistency of the Continuum Hypothesis”, in John N. Crossley, editor, Sets, Models, and Recursion Theory, North-Holland, page 7:",
"text": "Gödel's model is an example of a simple type of inner model that might be called a definable transitive inner model³), where the universe is replaced by a transitive subuniverse defined within ZF, the membership relation is just the original one restricted to the subuniverse, and where the axioms of ZF relativized to the subuniverse, are provable within ZF.",
"type": "quote"
},
{
"text": "1971, Ulrich Felgner, Models of ZF-Set Theory, Springer, Lecture Notes in Mathematics 223, page 21,\n1. Corollary: ZF is not finitely axiomatizable.\n2. Corollary: ZF is reflexive (i.e. the consistency of every finite subtheory of ZF can be proved within ZF)."
},
{
"text": "1991 [Kluwer Academic], Fred Landman, Structures for Semantics, 1991, Springer, Softcover, page 56,\nHowever, the problem with it, and the reason why it is not part of ZF strictly (apart from the fact that it implies the axiom of choice) is that it is rather arbitrary."
}
],
"glosses": [
"Initialism of Zermelo-Fraenkel (set theory): a particular axiomatic formulation of set theory without the axiom of choice."
],
"id": "en-ZF-en-noun-ye1vN26E",
"links": [
[
"set theory",
"set theory"
],
[
"Zermelo-Fraenkel",
"w:Zermelo-Fraenkel set theory"
],
[
"axiom of choice",
"axiom of choice"
]
],
"raw_glosses": [
"(set theory) Initialism of Zermelo-Fraenkel (set theory): a particular axiomatic formulation of set theory without the axiom of choice."
],
"tags": [
"abbreviation",
"alt-of",
"initialism",
"uncountable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
}
],
"wikipedia": [
"ZF"
],
"word": "ZF"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "ZF (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"alt_of": [
{
"word": "zero forcing"
}
],
"categories": [
{
"kind": "other",
"name": "English links with ignored alt parameters",
"parents": [
"Links with ignored alt parameters",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Signal processing",
"orig": "en:Signal processing",
"parents": [
"Applied mathematics",
"Telecommunications",
"Mathematics",
"Communication",
"Technology",
"Formal sciences",
"All topics",
"Sciences",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Telecommunications",
"orig": "en:Telecommunications",
"parents": [
"Communication",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "2008, Byeong Gi Lee, Sunghyun Choi, Broadband Wireless Access and Local Networks:",
"text": "In the case of the ZF detector, we suppress the interference among the transmit streams by multiplying the received signal vector y with the Moore-Penrose pseudo-inverse of the channel matrix […]",
"type": "quote"
},
{
"ref": "2010, Dayan Adionel Guimaraes, Digital Transmission, page 348:",
"text": "However, due to its simplicity, ZF equalization is a good choice when the channel is known and fixed, and also when there is no frequency notch in the channel frequency response […]",
"type": "quote"
},
{
"ref": "2013, Academic Press Library in Signal Processing, page 308:",
"text": "Thus, the importance of the upper bound is in showing that even in the most optimistic case, the achievable rate cannot exceed the ZF rates by more than 10%.",
"type": "quote"
}
],
"glosses": [
"Initialism of zero forcing."
],
"id": "en-ZF-en-adj-F6aWRh-i",
"links": [
[
"telecommunications",
"telecommunications"
],
[
"zero",
"zero#English"
],
[
"forcing",
"forcing#English"
]
],
"raw_glosses": [
"(telecommunications, signal processing) Initialism of zero forcing."
],
"related": [
{
"topics": [
"set-theory",
"mathematics",
"sciences"
],
"word": "NBG"
},
{
"topics": [
"set-theory",
"mathematics",
"sciences"
],
"word": "ZFC"
}
],
"tags": [
"abbreviation",
"alt-of",
"initialism",
"not-comparable"
],
"topics": [
"communications",
"computing",
"electrical-engineering",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences",
"signal-processing",
"telecommunications"
]
}
],
"wikipedia": [
"ZF"
],
"word": "ZF"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English uncomparable adjectives",
"English uncountable nouns",
"English words without vowels",
"Pages with 3 entries",
"Pages with entries"
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "ZF (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"alt_of": [
{
"extra": "(set theory): a particular axiomatic formulation of set theory without the axiom of choice",
"word": "Zermelo-Fraenkel"
}
],
"categories": [
"English initialisms",
"English links with redundant wikilinks",
"English terms with quotations",
"en:Set theory"
],
"examples": [
{
"ref": "1967, Carol Karp, “A Proof of the Relative Consistency of the Continuum Hypothesis”, in John N. Crossley, editor, Sets, Models, and Recursion Theory, North-Holland, page 7:",
"text": "Gödel's model is an example of a simple type of inner model that might be called a definable transitive inner model³), where the universe is replaced by a transitive subuniverse defined within ZF, the membership relation is just the original one restricted to the subuniverse, and where the axioms of ZF relativized to the subuniverse, are provable within ZF.",
"type": "quote"
},
{
"text": "1971, Ulrich Felgner, Models of ZF-Set Theory, Springer, Lecture Notes in Mathematics 223, page 21,\n1. Corollary: ZF is not finitely axiomatizable.\n2. Corollary: ZF is reflexive (i.e. the consistency of every finite subtheory of ZF can be proved within ZF)."
},
{
"text": "1991 [Kluwer Academic], Fred Landman, Structures for Semantics, 1991, Springer, Softcover, page 56,\nHowever, the problem with it, and the reason why it is not part of ZF strictly (apart from the fact that it implies the axiom of choice) is that it is rather arbitrary."
}
],
"glosses": [
"Initialism of Zermelo-Fraenkel (set theory): a particular axiomatic formulation of set theory without the axiom of choice."
],
"links": [
[
"set theory",
"set theory"
],
[
"Zermelo-Fraenkel",
"w:Zermelo-Fraenkel set theory"
],
[
"axiom of choice",
"axiom of choice"
]
],
"raw_glosses": [
"(set theory) Initialism of Zermelo-Fraenkel (set theory): a particular axiomatic formulation of set theory without the axiom of choice."
],
"tags": [
"abbreviation",
"alt-of",
"initialism",
"uncountable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
}
],
"wikipedia": [
"ZF"
],
"word": "ZF"
}
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English uncomparable adjectives",
"English uncountable nouns",
"English words without vowels",
"Pages with 3 entries",
"Pages with entries"
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "ZF (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"topics": [
"set-theory",
"mathematics",
"sciences"
],
"word": "NBG"
},
{
"topics": [
"set-theory",
"mathematics",
"sciences"
],
"word": "ZFC"
}
],
"senses": [
{
"alt_of": [
{
"word": "zero forcing"
}
],
"categories": [
"English initialisms",
"English links with ignored alt parameters",
"English terms with quotations",
"Quotation templates to be cleaned",
"en:Signal processing",
"en:Telecommunications"
],
"examples": [
{
"ref": "2008, Byeong Gi Lee, Sunghyun Choi, Broadband Wireless Access and Local Networks:",
"text": "In the case of the ZF detector, we suppress the interference among the transmit streams by multiplying the received signal vector y with the Moore-Penrose pseudo-inverse of the channel matrix […]",
"type": "quote"
},
{
"ref": "2010, Dayan Adionel Guimaraes, Digital Transmission, page 348:",
"text": "However, due to its simplicity, ZF equalization is a good choice when the channel is known and fixed, and also when there is no frequency notch in the channel frequency response […]",
"type": "quote"
},
{
"ref": "2013, Academic Press Library in Signal Processing, page 308:",
"text": "Thus, the importance of the upper bound is in showing that even in the most optimistic case, the achievable rate cannot exceed the ZF rates by more than 10%.",
"type": "quote"
}
],
"glosses": [
"Initialism of zero forcing."
],
"links": [
[
"telecommunications",
"telecommunications"
],
[
"zero",
"zero#English"
],
[
"forcing",
"forcing#English"
]
],
"raw_glosses": [
"(telecommunications, signal processing) Initialism of zero forcing."
],
"tags": [
"abbreviation",
"alt-of",
"initialism",
"not-comparable"
],
"topics": [
"communications",
"computing",
"electrical-engineering",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences",
"signal-processing",
"telecommunications"
]
}
],
"wikipedia": [
"ZF"
],
"word": "ZF"
}
Download raw JSONL data for ZF meaning in English (4.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.