In this article, we return to the problem of the derivation of a conclusion on the basis of fuzzy IF–THEN rules. The, so called Mamdani method is well elaborated and widely applied. In this article, we present an alternative to it. The fuzzy IF–THEN rules are here interpreted as genuine linguistic sentences consisting of the so called evaluating linguistic expressions. Sets of fuzzy IF–THEN rul...

Type assignment systems for λ-calculus based on intersection types are a general framework for building models of λ-calculus (known as filter-models) which are useful tools for reasoning in a finitary way about the denotational intepretation of terms. Indeed the denotation of a term is the set of types derivable for it and a type is a “finite piece” of information on such a denotation. This app...

The setting is that of an agent who needs to find out in which sense a predicate may have been used in a set of sentences received from a source. The agent should take into account both the logical constraints of the set of sentences and relevant semantic information concerning the predicate stored in his semantic memory. I present several adaptive fuzzy hedge logics. Each of these logics check...

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics LD and L I , based on Kripke semantics, and propose them as alternatives for D and I, respect...

This paper presents the semantics of CafeOBJ system and language. CafeOBJ is a succesor of the famous algebraic specification and programming language OBJ but adding several new primitive paradigms to the traditional OBJ language, such as rewriting logic, and behavioural concurrent specification. We do not address here the detalied mathematical aspects of CafeOBJ semantics (which sometimes coul...

The lazy evaluation of the λ-calculus, both in call-by-name and in call-by-value setting, is studied. Starting from a logical descriptions of two topological models of such calculi, a pre-order relation on terms, stratified by types, is defined, which grasps exactly the two operational semantics we want to model. Such a relation can be used for building two fully abstract models.