Abstract
This Isabelle/HOL formalization introduces a nested multiset datatype and defines Dershowitz and Manna's nested multiset order. The order is proved well founded and linear. By removing one constructor, we transform the nested multisets into hereditary multisets. These are isomorphic to the syntactic ordinals—the ordinals can be recursively expressed in Cantor normal form. Addition, subtraction, multiplication, and linear orders are provided on this type.
License
Topics
Session Nested_Multisets_Ordinals
- Multiset_More
- Signed_Multiset
- Nested_Multiset
- Hereditary_Multiset
- Signed_Hereditary_Multiset
- Syntactic_Ordinal
- Signed_Syntactic_Ordinal
- Syntactic_Ordinal_Bridge
- McCarthy_91
- Hydra_Battle
- Goodstein_Sequence
- Unary_PCF
Depends on
Used by
- Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms
- Formalization of Knuth–Bendix Orders for Lambda-Free Higher-Order Terms
- Formalization of Bachmair and Ganzinger's Ordered Resolution Prover
- A Verified Functional Implementation of Bachmair and Ganzinger's Ordered Resolution Prover
- Practical Algebraic Calculus Checker
- Formalization of Timely Dataflow's Progress Tracking Protocol
- Combinatorial Design Theory
- First Order Clause