A Complete Boolean Algebra without Homogeneous or Rigid Factors.
The concept of a deductive system has been intensively studied in algebraic logic, per se and in connection with various types of filters. In this paper we introduce an axiomatization which shows how several resembling theorems that had been separately proved for various algebras of logic can be given unique proofs within this axiomatic framework. We thus recapture theorems already known in the literature, as well as new ones. As a by-product we introduce the class of pre-BCK algebras.
This short note shows that the scheme of disjunctive reasoning, a or b, not b : a, does not hold neither in proper ortholattices nor in proper de Morgan algebras. In both cases the scheme, once translated into the inequality b' · (a+b) ≤ a, forces the structure to be a boolean algebra.
In this paper some properties of principal Boolean algebras are studied.