Schönfinkel-type operators for classical logic (Q993497): Difference between revisions

The author defines a new operator, dual to Schönfinkel's one, and proves that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic. It is shown that there are four binary operators such that each can serve as the only undefined logical constant for classical first-order logic and that, for every \(n\)-ary connective that yields a functionally complete singleton set of connectives, two Schönfinkel-type operators are definable, and all the latter ones are definable in this way.