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.
En su trabajo de 1973, ya clásico, Bellman y Giertz probaron que P(X) es un retículo distributivo con máximo y mínimo sólo (con hipótesis muy razonables) bajo las usuales definiciones (A U B)(x) = máx {A(x),B(x)}, (A ∩ B)(x) = mín {A(x),B(x)}, tratando escasamente el formalismo analítico relativo a la negación. En el presente trabajo se prueba que tal P(X) es un álgebra de DeMorgan si y sólo si la función de negación posee generador aditivo y que tales negaciones constituyen, en un cierto grupo...
In this paper we present and develop, only elementarily, an axiomatic frame for some special fuzzy relations, the so called relational probabilities, which happen to be families of functions which in some cases are quantic probabilities [1] on sublattices of a given lattice; in this way we obtain calculations similar to the ordinary ones but based on a weaker lattice background. This framework is inspired on the presentation of conditional probability on Boolean algebras made in [5] and in [4] and...
On caractérise toutes les entropies-floues qui sont des valuations des treillis P(X) des parties floues d'un ensemble fini X, on presente la construction de certaines entropies floues et on analyse leur caractère de valuation de treillis aiguisés Sh(g), g belonging to P(X).
In a Boolean Algebra B, an inequality f(x,x --> y)) ≤ y satisfying the condition f(1,1)=1, is considered for defining operations a --> b among the elements of B. These operations are called Conditionals'' for f. In this paper, we obtain all the boolean Conditionals and Internal Conditionals, and some of their properties as, for example, monotonicity are briefly discussed.
This paper deals with a new interpretation of a special functional characterisation of Sheffer strokes, with the study of morphisms and the construction of different De Morgan Algebras on a given set.
In the present note we study the effective construction of a natural generalized metric structure (on a set), obtaining as particular case the result of Menger. In the case of groups, we analyze its topology and its structure of natural proximity space (in the sense of Efremovic).
This paper is just a first approach to the idea that the membership function μ of a fuzzy set labelled P is, basically, a measure on the set of linguistic expressions x is P for each x in the corresponding universe of discourse X. Estimating that the meaning of P (relatively to X) is nothing else than the use of P on X, these measures seem to be reached by generalizing to a preordered set the concept of Fuzzy Measure, introduced by M. Sugeno, when the preorder translates the primary use of the predicate...
A mathematical model for conjectures (including hypotheses, consequences and speculations), was recently introduced, in the context of ortholattices, by Trillas, Cubillo and Castiñeira (Artificial Intelligence 117, 2000, 255-257). The aim of the present paper is to further clarify the structure of this model by studying its relationships with one of the most important ortholattices' relation, the orthogonality relation. The particular case of orthomodular lattices -the framework for both Boolean...
This paper investigates the satisfaction of the Non-Contradiction (NC) and Excluded-Middle (EM) laws within the domain of aggregation operators. It provides characterizations both for those aggregation operators that satisfy NC/EM with respect to (w.r.t.) some given strong negation, as well as for those satisfying them w.r.t. any strong negation. The results obtained are applied to some of the most important known classes of aggregation operators.
This paper deals with the satisfaction of the well-known Non-Contradiction (NC) and Excluded-Middle (EM) principles within the framework of aggregation operators. Both principles are interpreted in a non-standard way, based on self-contradiction (as in Ancient Logic) instead of falsity (as in Modern Logic). The logical negation is represented by means of strong negation functions, and conditions are given both for those aggregation operators that satisfy NC/EM with respect to (w.r.t.) some given...
This note deals with two logical topics and concerns Boolean Algebras from an elementary point of view. First we consider the class of operations on a Boolean Algebra that can be used for modelling If-then propositions. These operations, or Conditionals, are characterized under the hypothesis that they only obey to the Modus Ponens-Inequality, and it is shown that only six of them are boolean two-place functions. Is the Conditional Probability the Probability of a Conditional? This problem will...
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.
Using techniques for modeling indices by means of functional equations and resources from fuzzy set theory, the classical Balthazard index used in order to combine several degrees of impairment is characterized in two natural ways and its use is criticized. In addition some hints are given on how to study better solutions than Balthazard's one for the problem of combining impairment degrees.
The paper introduces a definition of symmetric difference in lattices with negation, presents its general properties and studies those that are typical of ortholattices, orthomodular lattices, De Morgan and Boolean algebras.
This paper deals with numerical functions J : [0,1] x [0,1] → [0,1] able to functionally express operators →: [0,1] x [0,1] → [0,1] defined as (μ → σ)(x,y) = J(μ(x),σ(y)), and verifying either Modus Ponens or Modus Tollens, or both. The concrete goal of the paper is to search for continuous t-norms T and strong-negation functions N for which it is either T(a, J(a,b)) ≤ b (Modus Ponens) or T(N(b), J(a,b)) ≤ N(a) (Modus Tollens), or both, for all a,b in [0,1] and a given J. Functions J are taken among...
This short note shows that the scheme of disjunctive reasoning, , not , does not hold neither in proper ortholattices nor in proper de Morgan algebras. In both cases the scheme, once translated into the inequality , forces the structure to be a boolean algebra.
In [6] an approach to the representation of synonyms and antonyms via the automorphisms of the De Morgan Algebra [0,1] was suggested. In [3], Ovchinnikov established a representation theorem for automorphisms of the function's complete and completely distributive lattice [0,1] with the pointwise extension of Min and Max operations in [0,1]. Ovchinnikov results are now inmediately generalized by using a positive t-norm T and its dual eta-dual t-conorm T*. These results are applied to study the automorphism...
Page 1 Next