scientific article; zbMATH DE number 3887650
In the author's paper in Notre Dame J. Formal Logic 15, 25-34 (1974; Zbl 0212.025) conjunction is defined in terms of the combinators K and S, restricted generality \(\Xi\) and H, the class of all propositions. This allowed the proof of \[ (1)\quad HX,HY\vdash H(X\wedge Y) \] \[ (2)\quad X,Y\vdash X\wedge Y \] \[ (3)\quad X\wedge Y,HX,HY\vdash X \] \[ (4)\quad X\wedge Y,HX,HY\vdash Y. \] Slightly more general axioms allowed him to prove (3) without HY and (4) without HX and a new axiom (3) without HX and (4) without HY in Notre Dame J. Formal Logic 20, 628-630 (1979; Zbl 0394.03024). The present paper suggests a new definition of conjunction, within a slightly more general system from which (3) and (4) can be proved without the restrictions HX and HY and in which (1) and (2) also remain provable. The problem of finding a similarly general definition of disjunction is still open.
- Arithmetic based on the Church numerals in illative combinatory logic
- scientific article; zbMATH DE number 1163994 (Why is no real title available?)
- scientific article; zbMATH DE number 3995671 (Why is no real title available?)
- A logic of hypothetical conjunction
- Béziau on \textit{and} and \textit{or}
- A calculus for the common rules of \(\wedge\) and \(\vee\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222161)