See algebraic poset in All languages combined, or Wiktionary
{ "forms": [ { "form": "algebraic posets", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "algebraic poset (plural algebraic posets)", "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": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Algebra", "orig": "en:Algebra", "parents": [ "Mathematics", "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "text": "1985 October, Rudolf-E. Hoffmann, The Injective Hull and the 𝒞ℒ-Compactification of a Continuous Poset, Canadian Journal of Mathematics, 37:5, Canadian Mathematical Society, page 833,\nA poset (P,<) is said to be algebraic if and only if\ni) P is up-complete, i.e., for every non-empty up-directed subset D,thesupremum operatorname supd exists,\nii) for every x∈P, the set\nK_X:=y∈P|ycompact,y<x\nis non-empty and up-directed, and\nx= operatorname supK_x.\nA poset P is an algebraic poset if and only if it is a continuous poset in which, for every x,y∈P,x≪y (if and) only if x<c<y for some compact element c of P.\nConcerning the definition of an algebraic poset, a caveat may be in order (which, mutatis mutandis, applies to continuous posets): it may happen that all of the axioms for an algebraic poset are satisfied except that the sets K_x fail to be up-directed ([50], 4.2 or [49], 4.5). Even when \"enough\" compact sets are readily available, it sometimes remains a delicate problem to verify the up-directedness of the sets K_x.\nThe concept of an algebraic poset arose in theoretical computer science ([50], [54], cf. also [14]). It is a natural extension of he familiar notion of a (complete) \"algebraic lattice\" (cf. [9], [20], I-4)." }, { "ref": "1988, Karel Hrbacek, “A Powerdomain Construction”, in Michael Main, Austin Melton, Michael Mislove, David Schmidt, editors, Mathematical Foundations of Programming Language Semantics: 3rd Workshop, Proceedings, Springer, page 202:", "text": "ALG is the category whose objects are algebraic posets and whose morphisms are continuous functions.\nA structure (D,#x5C;le#x5F;D,#x5C;cup#x5F;D) where (D,#x5C;le#x5F;D) is an algebraic poset and #x5C;cup#x5F;D is a binary operation on D which is continuous (in both variables), commutative, associative and absorptive (i.e., d#x5C;cup#x5F;Dd#x3D;d for all d#x5C;inD) will be called a nondeterministic algebraic poset.", "type": "quote" }, { "ref": "1992, Stephen D. Brookes et al., editors, Mathematical Foundations of Programming Semantics: 7th International Conference, Proceedings, Springer, page 88:", "text": "It is important to note that we have not assumed an algebraic poset is a cpo. The canonical example of an algebraic poset is #x7B;A#x2A;#x5C;cupA#x2A;#x7D;#x5C;sqrt#x7B;#x7D; in the prefix order; this poset enjoys the added condition that every element is compact.", "type": "quote" }, { "ref": "1997, Michael W. Shields, Semantics of Parallelism: Non-Interleaving Representation of Behaviour, Springer, page 41:", "text": "The correspondence between primes and occurrences suggests that given an abstract prime algebraic poset, we may construct a behavioural presentation from it.", "type": "quote" } ], "glosses": [ "A partially ordered set (poset) in which every element is the supremum of the compact elements below it." ], "id": "en-algebraic_poset-en-noun-XVqOh6C2", "links": [ [ "algebra", "algebra" ], [ "partially ordered set", "partially ordered set" ], [ "supremum", "supremum" ], [ "compact element", "compact element" ] ], "raw_glosses": [ "(algebra, order theory) A partially ordered set (poset) in which every element is the supremum of the compact elements below it." ], "related": [ { "word": "complete partial order" }, { "word": "up-complete poset" }, { "word": "up-directed" } ], "topics": [ "algebra", "mathematics", "order-theory", "sciences" ] } ], "word": "algebraic poset" }
{ "forms": [ { "form": "algebraic posets", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "algebraic poset (plural algebraic posets)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "related": [ { "word": "complete partial order" }, { "word": "up-complete poset" }, { "word": "up-directed" } ], "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English multiword terms", "English nouns", "English terms with quotations", "Pages with 1 entry", "Pages with entries", "en:Algebra" ], "examples": [ { "text": "1985 October, Rudolf-E. Hoffmann, The Injective Hull and the 𝒞ℒ-Compactification of a Continuous Poset, Canadian Journal of Mathematics, 37:5, Canadian Mathematical Society, page 833,\nA poset (P,<) is said to be algebraic if and only if\ni) P is up-complete, i.e., for every non-empty up-directed subset D,thesupremum operatorname supd exists,\nii) for every x∈P, the set\nK_X:=y∈P|ycompact,y<x\nis non-empty and up-directed, and\nx= operatorname supK_x.\nA poset P is an algebraic poset if and only if it is a continuous poset in which, for every x,y∈P,x≪y (if and) only if x<c<y for some compact element c of P.\nConcerning the definition of an algebraic poset, a caveat may be in order (which, mutatis mutandis, applies to continuous posets): it may happen that all of the axioms for an algebraic poset are satisfied except that the sets K_x fail to be up-directed ([50], 4.2 or [49], 4.5). Even when \"enough\" compact sets are readily available, it sometimes remains a delicate problem to verify the up-directedness of the sets K_x.\nThe concept of an algebraic poset arose in theoretical computer science ([50], [54], cf. also [14]). It is a natural extension of he familiar notion of a (complete) \"algebraic lattice\" (cf. [9], [20], I-4)." }, { "ref": "1988, Karel Hrbacek, “A Powerdomain Construction”, in Michael Main, Austin Melton, Michael Mislove, David Schmidt, editors, Mathematical Foundations of Programming Language Semantics: 3rd Workshop, Proceedings, Springer, page 202:", "text": "ALG is the category whose objects are algebraic posets and whose morphisms are continuous functions.\nA structure (D,#x5C;le#x5F;D,#x5C;cup#x5F;D) where (D,#x5C;le#x5F;D) is an algebraic poset and #x5C;cup#x5F;D is a binary operation on D which is continuous (in both variables), commutative, associative and absorptive (i.e., d#x5C;cup#x5F;Dd#x3D;d for all d#x5C;inD) will be called a nondeterministic algebraic poset.", "type": "quote" }, { "ref": "1992, Stephen D. Brookes et al., editors, Mathematical Foundations of Programming Semantics: 7th International Conference, Proceedings, Springer, page 88:", "text": "It is important to note that we have not assumed an algebraic poset is a cpo. The canonical example of an algebraic poset is #x7B;A#x2A;#x5C;cupA#x2A;#x7D;#x5C;sqrt#x7B;#x7D; in the prefix order; this poset enjoys the added condition that every element is compact.", "type": "quote" }, { "ref": "1997, Michael W. Shields, Semantics of Parallelism: Non-Interleaving Representation of Behaviour, Springer, page 41:", "text": "The correspondence between primes and occurrences suggests that given an abstract prime algebraic poset, we may construct a behavioural presentation from it.", "type": "quote" } ], "glosses": [ "A partially ordered set (poset) in which every element is the supremum of the compact elements below it." ], "links": [ [ "algebra", "algebra" ], [ "partially ordered set", "partially ordered set" ], [ "supremum", "supremum" ], [ "compact element", "compact element" ] ], "raw_glosses": [ "(algebra, order theory) A partially ordered set (poset) in which every element is the supremum of the compact elements below it." ], "topics": [ "algebra", "mathematics", "order-theory", "sciences" ] } ], "word": "algebraic poset" }
Download raw JSONL data for algebraic poset meaning in English (3.8kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). 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.