Filtering formulas
\textit{E. A. Palyutin} [Algebra Logika 19, 582-614 (1980; Zbl 0491.03011)] introduced a class of formulas which he called \(h\)-formulas, instead of this term the author uses the term ``\(P\)-formula here. In the first paragraph, the notion of a normal, weakly bundled valuation in a complete continuous lattice is given. It is proved that for filtered formulas the notions of truth and global truth (i.e. the equality of the valuation of the formula to 1 of the lattice) coincide. Moreover, there is a complete proof of the theorem stated in the author's paper reviewed above on equivalence of any filtered formula to some \(P\)-formula.
This page was built for publication: Filtering formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366367)