Let \(\vdash^*\) denote the common sequential rules for \(\wedge\) and \(\vee\). Let \(\vdash^{\wedge}\) denote the sequential rules for \(\wedge\), and \(\vdash^{\vee}\) denote those for \(\vee\). The author's main questions are: (a) Is \(\vdash^*\) finitely based?, and: (b) Are \(\vdash^{\wedge}\) and \(\vdash^{\vee}\) the only proper non-trivial strengthenings of \(\vdash^*?\) As his work shows: ``Both questions have a positive answer, but the proofs are not as easy as one might expect. But his work has far greater theoretical and technical interest than these two questions about \(\wedge\) and \(\vee\) might indicate. He indicates how such question might be of interest to computer science. His work brings out that there are challenging problems in the area of asking analogous questions for other dual operators.
- Investigations into a left-structural right-substructural sequent calculus
- Singulary extensional connectives: A closer look
- False though partly true -- an experiment in logic
- On the poset of computation rules for nonassociative calculus
- Replacement in logic
- Identical twins, deduction theorems, and pattern functions: Exploring the implicative BCSK fragment of S5
- Axiomatization of the De Morgan type rules
- scientific article; zbMATH DE number 4101153 (Why is no real title available?)
- Aggregation and idempotence
This page was built for publication: A calculus for the common rules of \(\wedge\) and \(\vee\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918952)
