Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dershowitz–Manna_ordering> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Dershowitz–Manna_ordering abstract "In mathematics, the Dershowitz–Manna ordering is a well-founded ordering on multisets named after Nachum Dershowitz and Zohar Manna. It is often used in context of termination of programs or term rewriting systems.Suppose that is a partial order, and let be the set of all finite multisets on . For multisets we define the Dershowitz–Manna ordering as follows:whenever there exist two multisets with the following properties:,,, anddominates , that is, for all , there is some such that .An equivalent definition was given by Huet and Oppen as follows:if and only if , andfor all , if then there is some in such that and .".
- Dershowitz–Manna_ordering wikiPageID "38676534".
- Dershowitz–Manna_ordering wikiPageRevisionID "569393510".
- Dershowitz–Manna_ordering subject Category:Formal_languages.
- Dershowitz–Manna_ordering subject Category:Logic_in_computer_science.
- Dershowitz–Manna_ordering subject Category:Rewriting_systems.
- Dershowitz–Manna_ordering comment "In mathematics, the Dershowitz–Manna ordering is a well-founded ordering on multisets named after Nachum Dershowitz and Zohar Manna. It is often used in context of termination of programs or term rewriting systems.Suppose that is a partial order, and let be the set of all finite multisets on .".
- Dershowitz–Manna_ordering label "Dershowitz–Manna ordering".
- Dershowitz–Manna_ordering sameAs Dershowitz%E2%80%93Manna_ordering.
- Dershowitz–Manna_ordering sameAs Q17008947.
- Dershowitz–Manna_ordering sameAs Q17008947.
- Dershowitz–Manna_ordering wasDerivedFrom Dershowitz–Manna_ordering?oldid=569393510.