Search

We study the forcing operators on MTL-algebras, an algebraic notion inspired by the Kripke semantics of the monoidal t -norm based logic (MTL). At logical level, they provide the notion of the forcing value of an MTL-formula. We characterize the forcing operators in terms of some MTL-algebras morphisms. From this result we derive the equality of the forcing value and the truth value of an MTL-formula (© 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) [ABSTRACT FROM AUTHOR]

In this paper we define the polyadic Pavelka algebras as algebraic structures for Rational Pavelka predicate calculus (RPL∀). We prove two representation theorems which are the algebraic counterpart of the completness theorem for RPL∀. [ABSTRACT FROM AUTHOR]

The article presents a study investigating topologies on distributive lattices and the localization lattices by using the concept of multipliers. It is mentioned that, localization lattice is isomorphic to a certain sublattice of the maximal lattice of quotients of distributive lattice with canonical congruence associated with the topology. Conditions for non-empty set of ideals in distributive lattice to be a topology are also presented.

The article offers information on the study related to the model-theoretic properties of Boolean-valued models. It is assumed that the L is the first-order language with one constant symbol. It offers information on the generalization to the Boolean-valued case using consistent theory, diagram of a structure, ultraproducts.