scientific article; zbMATH DE number 1145524

From MaRDI portal
Publication:4384760





The author considers logics whose formulas have a single variable. He denotes by \(L\) the set of these logics (in a canonical way \(L\) is a lattice) and by \(L'\) the set of finitely generated logics. In the first part of this paper, the author proves that every finite lattice is imbedded in a canonical way in \(L'\) and every infinitely denumerable lattice is imbedded in \(L\). In the second part of the paper, he constructs an algorithm to solve the problem of equality of two words from finite logics.











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 Q4384760)