A new foundation of a complete Boolean equational logic
From MaRDI portal
Recommendations
Cited in
(6)- Computational isomorphisms in classical logic
- On the soundness and completeness of equational predicate logics
- scientific article; zbMATH DE number 475241 (Why is no real title available?)
- scientific article; zbMATH DE number 2015284 (Why is no real title available?)
- ON EQUATIONAL COMPLETENESS THEOREMS
- New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
This page was built for publication: A new foundation of a complete Boolean equational logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411446)