On sensible fuzzy ideals of BCK-algebras with respect to a t-conorm.
The well-known Dyckoff's 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidability of this calculus is given. An upper bound on the depth of a Kripke counter-model is obtained.
We study definable sets D of SU-rank 1 in , where ℳ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such D can be seen as a ’canonically embedded structure’, which inherits all relations on D which are definable in , and has no other definable relations. Our results imply that if no relation symbol of the language of ℳ has arity higher than 2, then there is a close relationship between triviality of dependence and being a reduct of a binary...
Mono-unary algebras may be used to construct homomorphisms, subalgebras, and direct products of algebras of an arbitrary type.
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.
Given a triangular norm T, its t-reverse T*, introduced by C. Kimberling (Publ. Math. Debrecen 20, 21-39, 1973) under the name invert, is studied. The question under which conditions we have T** = T is completely solved. The t-reverses of ordinal sums of t-norms are investigated and a complete description of continuous, self-reverse t-norms is given, leading to a new characterization of the continuous t-norms T such that the function G(x,y) = x + y - T(x,y) is a t-conorm, a problem originally studied...
We give some structures without quantifier elimination but in which the closure, and hence the interior and the boundary, of a quantifier free definable set is also a quantifier free definable set.