Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL

  title={Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL},
  author={Jasmin Christian Blanchette and Mathias Fleury and Dmitriy Traytel},
We present a collection of formalized results about finite nested multisets, developed using the Isabelle/HOL proof assistant. The nested multiset order is a generalization of the multiset order that can be used to prove termination of processes. Hereditary multisets, a variant of nested multisets, offer a convenient representation of ordinals below 0. In Isabelle/HOL, both nested and hereditary multisets can be comfortably defined as inductive datatypes. Our formal library also provides… 

Type-Theoretic Approaches to Ordinals

. In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences

Connecting Constructive Notions of Ordinals in Homotopy Type Theory

This work considers three different notions of ordinals in homotopy type theory, and shows how they relate to each other: a notation system based on Cantor normal forms, a refined notion of Brouwer trees, and wellfounded extensional orders.

Formalization of logical calculi in Isabelle/HOL

A formal framework for propositional satifisfiability with the conflict-driven clause learning (CDCL) procedure using the Isabelle/HOL proof assistant is developed and the inclusion of rules for forget and restart and the refinement approach are included.

Formalization of Logic in the Isabelle Proof Assistant

This thesis describes formalizations in Isabelle of several logics as well as tools built upon these, including the Natural Deduction Assistant (NaDeA), which is a tool for teaching first-order logic that allows users to build proofs in natural deduction.

Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)

This paper describes and reflects on three verification subprojects to which I contributed: a first-order resolution prover, an imperative SAT solver, and generalized term orders for λ-free higher-order logic.

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

We describe a line of work that started in 2011 towards enriching Isabelle/HOL’s language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive

Three equivalent ordinal notation systems in cubical Agda

Three ordinal notation systems representing ordinals below ε0 in type theory are presented, using recent type-theoretical innovations such as mutual inductive-inductive definitions and higher inductive types, and it is proved that all three notation systems are equivalent, so that results between them use the univalence principle.

Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover

We present an Isabelle/HOL formalization of the first half of Bachmair and Ganzinger’s chapter on resolution theorem proving, culminating with a refutationally complete first-order prover based on

A Mechanizable First-Order Theory of Ordinals

A first-order theory of ordinals without resorting to set theory is presented, which is implemented in the KeY program verification system and used to prove termination of a Java program computing the Goodstein sequences.

Verified Progress Tracking for Timely Dataflow

This work modeled the progress tracking protocol as a combination of two independent transition systems in the Isabelle/HOL proof assistant and identified abstract assumptions on dataflow programs that are sufficient for safety and were not previously formalized.



Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals

This Isabelle/HOL formalization introduces a nested multiset datatype and proves Dershowitz and Manna's nested mult iset order well founded and linear.

Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving

A fully modular framework for constructing (co)datatypes in HOL, with support for mixed mutual and nested ( co)recursion, and that of a bounded natural functor---an enriched type constructor satisfying specific properties preserved by interesting categorical operations.

On the Formalization of Termination Techniques based on Multiset Orderings

It is shown that checking the correct application of the techniques--where all parameters are provided--is also NP-hard, since the problem of deciding the generalized multiset ordering is NP- hard.

Implementation of three types of ordinals in Coq

One can define an inductive type T in Coq by the rules: zero is in T, and 'cons a n b' is in T when a, b are in T and n is an integer. One can embed this type with an ordering, and show that the

Quotients revisited for Isabelle/HOL

Higher-Order Logic (HOL) is based on a small logic kernel, whose only mechanism for extension is the introduction of safe definitions and of non-empty types, and this work re-implemented in the Isabelle/HOL theorem prover the quotient package by Homeier, in order to deal with compositions of quotients.

Proving termination with multiset orderings

The multiset ordering enables the use of relatively simple and intuitive termination functions in otherwise difficult termination proofs, and is used to prove the termination of production systems, programs defined in terms of sets of rewriting rules.

On the restricted ordinal theorem

Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument, by utilising transfinitely induction to prove that certain sequences of reduction processes, enumerated by ordinals less than e, are finite.

Cardinals in Isabelle/HOL

A “decentralized” representation of ordinals and cardinals in Isabelle/HOL is reported on, that identifies ordinals with wellorders, with all concepts and results proved to be invariant under order isomorphism.

Generalised multisets for chemical programming

This article generalises the notion of multiset used by Gamma to include rewrite rules, which become first-class citizens and builds a higher-order chemical programming language called HOCL.