The paper deals with fuzzy logic in the narrow sense of Lukasiewicz style, i.e. a special kind of many-valued logic which is aimed at modeling of vagueness phenomenon. This logic is a generalization of Lukasiewicz logic with many interesting properties (for example, generalization of the deduction and completeness theorems hold in it). Our aim is to prepare the background for the resolution in ...

This paper explores relationships between many-valued logic and fuzzy topology from the viewpoint of duality theory. We first show a fuzzy topological duality for the algebras of Lukasiewicz n-valued logic with truth constants, which generalizes Stone duality for Boolean algebras to the n-valued case via fuzzy topology. Then, based on this duality, we show a fuzzy topological duality for the al...

Monadic MV –algebras are an algebraic model of the predicate calculus of the Lukasiewicz infinite valued logic in which only a single individual variable occurs. GMV -algebras are a non-commutative generalization of MV -algebras and are an algebraic counterpart of the non-commutative Lukasiewicz infinite valued logic. We introduce monadic GMV -algebras and describe their connections to certain ...

A topological duality for monadic n-valued Lukasiewicz algebras introduced by M. Abad (Abad, M.: Estructuras cíclica y monádica de un álgebra de Lukasiewicz nvalente. Notas de Lógica Matemática 36. Instituto de Matemática. Universidad Nacional del Sur, 1988) is determined. When restricted to the category of Q-distributive lattices and Q-homomorphims, it coincides with the duality obtained by R....

Many algebraic preconditioners rely on incomplete factorization, where nonzero entries are dropped, based on some rule, during the factorization process. In a series of papers by Bollhöfer and Saad [2, 3, 4] it was shown that robust rules for both dropping and pivoting can be obtained from information about the inverses of the submatrices that are consecutively constructed. In particular, monit...

We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain problems of structural model-based causality and explanation to be tractably solved. In this paper, we first address an open question raised by Eiter and Lukasiewicz – the computational complexity of deciding whether a...

Motivated by aspects of reasoning in theories of physics, Robin Giles defined a characterization of infinite valued Lukasiewicz logic in terms of a game that combines Lorenzen-style dialogue rules for logical connectives with a scheme for betting on results of dispersive experiments for evaluating atomic propositions. We analyze this game and provide conditions on payoff functions that allow us...

We introduce a framework within which reasoning according to à Lukasiewicz logic can be represented. We consider a separable Boolean algebra B endowed with a (certain type of) group G of automorphisms; the pair (B, G) will be called a Boolean ambiguity algebra. B is meant to model a system of crisp properties; G is meant to express uncertainty about these properties. We define fuzzy proposition...

Lukasiewicz's four-valued modal logic is surveyed and analyzed.

This paper deals with Zadeh’s compositional rule of inference [12] under triangular norms: IF X is P AND X and Y have relation R, THEN Y is Q, where P and Q are fuzzy sets of the real line IR, R is a fuzzy relation on IR and the conclusion Q is defined via sup-T composition of P and R: μQ(y) = sup x∈IR T (μP (x), μR(x, y)), y ∈ IR. It is shown that (i) when the triangular norm T and the members...