On the embeddability of certain generalizations of pseudo-Boolean algebras

This paper is devoted to the study of the isomorphic embeddability of \(\nu\)-algebras into other \(\nu\)-algebras, where \(\nu\) is a set of propositional connectives that contains \(\supset\) (implication). If \(\nu\) contains all four propositional connectives, the \(\nu\)-algebras are exactly the pseudo-Boolean algebras. In this work, we obtain, for finite \(\nu\)-algebras, criteria of isomorphic embeddability that are based on the representation of finite \(\nu\cup\{\&\}\)-algebras via \(\supset\)-algebras of a special form. These criteria reduce solving the problem of embeddability of one finite \(\nu\)-algebra into another one to the problem of immersion of the representing \(\supset\)-algebras into other ones. Note that the concept of immersion of \(\supset\)-algebras is introduced in this work for the first time. The sequence of finite Gödel pseudo-Boolean algebras, introduced by S. Jaśkowski, has the following algebraic property: each finite Gödel pseudo-Boolean algebra is isomorphically embeddable into an algebra of this sequence. In this work, we get an analog of this result, namely, we construct a class of finite pseudo-Boolean algebras such that each finite \(\nu\)-algebra is isomorphically embeddable into an appropriate algebra of this class.

Recommendations

Cited in

(9)

This page was built for publication: On the embeddability of certain generalizations of pseudo-Boolean algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385865)