Quasi-boolean equivalence

DOI10.1016/0020-0190(93)90211-QMaRDI QIDQ2366071zbMATH OpenFDO

Authors A. Bijlsma

Publication date 29 June 1993

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

undefinednessequational proofs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• A logic covering undefinedness in program proofs
• A note on undefined expression values in programming logics
• scientific article; zbMATH DE number 2102744
• Adas and the equational theory of if-then-else
• scientific article; zbMATH DE number 4090769

Cites work

• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 46743 (Why is no real title available?)
• scientific article; zbMATH DE number 194642 (Why is no real title available?)
• A logic covering undefinedness in program proofs
• Predicative methodology
• Programming as a Discipline of Mathematical Nature
• Quasi-boolean equivalence

Cited in

(5)

• A note on undefined expression values in programming logics
• Properties of quasi-Boolean function on quasi-Boolean algebra
• scientific article; zbMATH DE number 718635 (Why is no real title available?)
• Quasi-boolean equivalence
• scientific article; zbMATH DE number 2102744 (Why is no real title available?)

This page was built for publication: Quasi-boolean equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366071)