On A Class Of Sentential Functions
It is shown, in a general frame and playing with idempotency, that in order to have on a given lattice a Multiple Valued Logic preserving the lattice structure, the only t-norms and t-conorms allowing to modelize the truth values of a v b, a ^ b and a --> b are Min and Max, respectively, apart from ordinal sums.
The concept of logical fiberings is briefly summarized. Based on experiences with concrete examples an algorithmic approach is developed which leads to a represention of a many-valued logic as a logical fibering. The Stone isomorphism for expressing classical logical operations by corresponding polynomials can be extended to m-valued logics. On the basis of this, a classical deduction problem can be treated symbolically as a corresponding ideal membership problem using computer algebra support with...
It is well known that the fuzzy sets theory can be successfully used in quantum models ([5, 26]). In this paper we give first a review of recent development in the probability theory on tribes and their generalizations – multivalued (MV)-algebras. Secondly we show some applications of the described method to develop probability theory on IF-events.
In this paper we examine discrete functions that depend on their variables in a particular way, namely the H-functions. The results obtained in this work make the “construction” of these functions possible. H-functions are generalized, as well as their matrix representation by Latin hypercubes.