The completeness of the factor semantics for Łukasiewicz's infinite- valued logics
This paper considers a factor set of countable \(T\)-\(F\)-sequences for which the number of occurrences of \(T\) or \(F\) is finite, as a model of the Łukasiewicz's infinite-valued logics. The completeness of this factor semantics is proven using Wajsberg algebras and symmetrical Heyting monoids.
scientific article; zbMATH DE number 165917