...-... Algebras.
[0,1]-Valued Logic: A Natural Generalization of Boolean Logic
1.0957-Approximation Algorithm for Random MAX-3SAT
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
A calculus for finitely satisfiable formulas with identity.
A ...-calculus with an algorithmic ... .
A certain Galois connection and weak automorphisms
A characterization for residuated implications on the set of all the closed intervals in J[0,1]. Application to the L-fuzzy concept theory.
In this paper, a new characterization for the interval-valued residuated fuzzy implication operators is presented, with which it is possible to use them in a simple and efficient way, since the calculation of the values of an intervalvalued implication applicated to two intervals is reduced to the study of a fuzzy implication applicated to the extremes of these intervals. This result is very important in order to extract knowledge from an L-fuzzy context with incomplete information. Finally, some...
A characterization of r-maximal sets.
A characterization of uninorms on bounded lattices via closure and interior operators
Uninorms on bounded lattices have been recently a remarkable field of inquiry. In the present study, we introduce two novel construction approaches for uninorms on bounded lattices with a neutral element, where some necessary and sufficient conditions are required. These constructions exploit a t-norm and a closure operator, or a t-conorm and an interior operator on a bounded lattice. Some illustrative examples are also included to help comprehend the newly added classes of uninorms.
A completeness theorem for the general interpreted modal calculus of A. Bressan
A completeness theorem for two-parameter stochastic processes
A completeness theorem in the modal logic of programs
A Completness Theorem For One Class Of The Propositional Calculi
A constructive proof of equivalence of formalism of DCG's with the formalism of type 0 phrase-structure grammars.
A contour view on uninorm properties
Any given increasing function is completely determined by its contour lines. In this paper we show how each individual uninorm property can be translated into a property of contour lines. In particular, we describe commutativity in terms of orthosymmetry and we link associativity to the portation law and the exchange principle. Contrapositivity and rotation invariance are used to characterize uninorms that have a continuous contour line.
A criterion for admissibility of inference rules in some class of S4-logics without the branching property.
A decidable -categorical theory with a non-recursive Ryll-Nardzewski function
A decision method for the recognizability of sets defined by number systems
A Decision Procedure for Certain Disjunction-free Intermediate Propositional Calculi
A duality between algebras of basic logic and bounded representable -monoids
-algebras, introduced by P. Hájek, form an algebraic counterpart of the basic fuzzy logic. In the paper it is shown that -algebras are the duals of bounded representable -monoids. This duality enables us to describe some structure properties of -algebras.