Currently displaying 1 – 17 of 17

Showing per page

Order by Relevance | Title | Year of publication

On Boolean modus ponens.

Sergiu Rudeanu — 1998

Mathware and Soft Computing

An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].

A glimpse of deductive systems in algebra

Dumitru BuşneagSergiu Rudeanu — 2010

Open Mathematics

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.

Equational spectrum of Hilbert varieties

R. PadmanabhanSergiu Rudeanu — 2009

Open Mathematics

We prove that an equational class of Hilbert algebras cannot be defined by a single equation. In particular Hilbert algebras and implication algebras are not one-based. Also, we use a seminal theorem of Alfred Tarski in equational logic to characterize the set of cardinalities of all finite irredundant bases of the varieties of Hilbert algebras, implication algebras and commutative BCK algebras: all these varieties can be defined by independent bases of n elements, for each n > 1.

Page 1

Download Results (CSV)