Example verifications using alphabet axioms

DOI10.1007/PL00003925zbMath0912.68118OpenAlexW2050299875WikidataQ114693101 ScholiaQ114693101MaRDI QIDQ1271853

Henri Korver, Alex Sellink

Publication date: 11 November 1998

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00003925

zbMATH Keywords

proof theoryalphabet axioms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Related Items (1)

Multiparty Contract Signing Over a Reliable Network

This page was built for publication: Example verifications using alphabet axioms