See partial function on Wiktionary
{
"antonyms": [
{
"english": "function whose domain is a subset of the set on which it is formally defined",
"sense": "antonym(s) of",
"topics": [
"mathematics",
"sciences"
],
"word": "total function"
}
],
"forms": [
{
"form": "partial functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "partial function (plural partial functions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"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": "other",
"name": "Terms with Icelandic translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Italian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Functions",
"orig": "en:Functions",
"parents": [
"Algebra",
"Calculus",
"Geometry",
"Mathematical analysis",
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "1967 [John Wiley & Sons], Stephen Cole Kleene, Mathematical Logic, 2002, Dover, page 244,\nThe Church-Turing thesis applies to partial functions on the same grounds as to total functions (§ 41)."
},
{
"text": "1991, Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella (editors), Algebraic System Specification and Development: A Survey and Annotated Bibliography, Springer, LNCS 501, page 15,\nNowadays it seems quite clear that if algebraic specifications are to be used as a powerful and realistic tool for the development of complex systems they should permit the specification of partial functions. […] There are essentially two ways of specifying partial functions."
},
{
"text": "2006, Paulo Oliva, Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis, Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker (editors), Logical Approaches to Computational Barriers: 2nd Conference on Computability in Europe, Proceedings, Springer, LNCS 3988, page 432,\nIn the following σ and τ will denote finite partial functions from N to N , i.e. partial functions which are defined on a finite domain. A partial function which is everywhere undefined is denoted by ⟨⟩, whereas a partial function defined only at position k (with value n) is denoted by ⟨k,n⟩."
}
],
"glosses": [
"A function whose domain is a subset of the set on which it is formally defined; i.e., a function f: X→Y for which values f(x) are defined only for x ∈ W, where W ⊆ X."
],
"id": "en-partial_function-en-noun-04~uhkpI",
"links": [
[
"mathematics",
"mathematics"
],
[
"function",
"function"
],
[
"domain",
"domain"
],
[
"subset",
"subset"
]
],
"raw_glosses": [
"(mathematics) A function whose domain is a subset of the set on which it is formally defined; i.e., a function f: X→Y for which values f(x) are defined only for x ∈ W, where W ⊆ X."
],
"topics": [
"mathematics",
"sciences"
],
"translations": [
{
"code": "is",
"lang": "Icelandic",
"sense": "mathematics: a function whose domain is a subset of the set on which it is formally defined",
"tags": [
"neuter"
],
"word": "hlutskilgreint fall"
},
{
"code": "it",
"lang": "Italian",
"sense": "mathematics: a function whose domain is a subset of the set on which it is formally defined",
"tags": [
"feminine"
],
"word": "funzione parziale"
}
],
"wikipedia": [
"partial function"
]
}
],
"word": "partial function"
}
{
"antonyms": [
{
"english": "function whose domain is a subset of the set on which it is formally defined",
"sense": "antonym(s) of",
"topics": [
"mathematics",
"sciences"
],
"word": "total function"
}
],
"forms": [
{
"form": "partial functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "partial function (plural partial functions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Icelandic translations",
"Terms with Italian translations",
"en:Functions",
"en:Mathematics"
],
"examples": [
{
"text": "1967 [John Wiley & Sons], Stephen Cole Kleene, Mathematical Logic, 2002, Dover, page 244,\nThe Church-Turing thesis applies to partial functions on the same grounds as to total functions (§ 41)."
},
{
"text": "1991, Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella (editors), Algebraic System Specification and Development: A Survey and Annotated Bibliography, Springer, LNCS 501, page 15,\nNowadays it seems quite clear that if algebraic specifications are to be used as a powerful and realistic tool for the development of complex systems they should permit the specification of partial functions. […] There are essentially two ways of specifying partial functions."
},
{
"text": "2006, Paulo Oliva, Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis, Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker (editors), Logical Approaches to Computational Barriers: 2nd Conference on Computability in Europe, Proceedings, Springer, LNCS 3988, page 432,\nIn the following σ and τ will denote finite partial functions from N to N , i.e. partial functions which are defined on a finite domain. A partial function which is everywhere undefined is denoted by ⟨⟩, whereas a partial function defined only at position k (with value n) is denoted by ⟨k,n⟩."
}
],
"glosses": [
"A function whose domain is a subset of the set on which it is formally defined; i.e., a function f: X→Y for which values f(x) are defined only for x ∈ W, where W ⊆ X."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"function",
"function"
],
[
"domain",
"domain"
],
[
"subset",
"subset"
]
],
"raw_glosses": [
"(mathematics) A function whose domain is a subset of the set on which it is formally defined; i.e., a function f: X→Y for which values f(x) are defined only for x ∈ W, where W ⊆ X."
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"partial function"
]
}
],
"translations": [
{
"code": "is",
"lang": "Icelandic",
"sense": "mathematics: a function whose domain is a subset of the set on which it is formally defined",
"tags": [
"neuter"
],
"word": "hlutskilgreint fall"
},
{
"code": "it",
"lang": "Italian",
"sense": "mathematics: a function whose domain is a subset of the set on which it is formally defined",
"tags": [
"feminine"
],
"word": "funzione parziale"
}
],
"word": "partial function"
}
Download raw JSONL data for partial function meaning in All languages combined (3.1kB)
This page is a part of the kaikki.org machine-readable All languages combined 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.