A Hierarchy of Algebras for Boolean Subsets

DOI10.1007/978-3-030-43520-2_10OpenAlexW3013515998MaRDI QIDQ5098719

Walter Guttmann, Bernhard Möller

Publication date: 30 August 2022

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/91142/91142.pdf

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Nitpick
• Isabelle/HOL
• Prover9
• Mace4
• Sledgehammer
• Stone Algebras
• Archive Formal Proofs
• Robbins Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Internal axioms for domain semirings
• Algebras for iteration and infinite computations
• Algebras of modal operators and partial correctness
• Parallel constructions of maximal path sets and applications to short superstrings
• An equational axiomatization of dynamic negation and relational composition
• Isabelle/HOL. A proof assistant for higher-order logic
• Short single axioms for Boolean algebra
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Equational logic
• Stone lattices
• Pseudo-complements in semi-lattices
• Semilattice Pseudo-complements on Semigroups
• Introduction to Boolean Algebras
• Constructive Type Classes in Isabelle
• Domain and Antidomain Semigroups
• Extending Sledgehammer with SMT Solvers
• Kleene algebra with domain
• Fuzzifying Modal Algebra
• Domain Axioms for a Family of Near-Semirings
• Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
• Two brief formulations of Boolean algebra
• Representations of Boolean algebras

This page was built for publication: A Hierarchy of Algebras for Boolean Subsets