Axiomatizing the skew Boolean propositional calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 922613 (Why is no real title available?)
- scientific article; zbMATH DE number 5041282 (Why is no real title available?)
- A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke
- Algebraizable logics
- An abstract algebraic logic approach to tetravalent modal logics
- An algebraic approach to non-classical logics
- An intriguing logic with two implicational connectives
- Automated discovery of single axioms for ortholattices
- Complexity and related enhancements for automated theorem-proving programs
- Fregean logics
- Identical twins, deduction theorems, and pattern functions: Exploring the implicative BCSK fragment of S5
- Introduction to the special issue on algebraic logic
- Metamathematics of fuzzy logic
- Principal congruences of tetravalent modal algebras
- Solving open questions and other challenge problems using proof sketches
- Using hints to increase the effectiveness of an automated reasoning program: Case studies
Cited in
(8)- Categorical skew lattices
- Varieties of skew Boolean algebras with intersections
- Cancellation in skew lattices
- Residuated skew lattices
- Solving open questions and other challenge problems using proof sketches
- My journey into noncommutative lattices and their theory
- Distributivity in skew lattices
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
This page was built for publication: Axiomatizing the skew Boolean propositional calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877820)
