Filtering formulas (Q2366367)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 223738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Filtering formulas |
scientific article; zbMATH DE number 223738 |
Statements
Filtering formulas (English)
0 references
29 June 1993
0 references
\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.
0 references
reduced product
0 references
\(h\)-formulas
0 references
valuation in a complete continuous lattice
0 references
filtered formula
0 references
\(P\)-formula
0 references
0.7145711779594421
0 references
0.6852912902832031
0 references
