Interval MV-algebras and generalizations
Abstract
For any MV-algebra A we equip the set I(A) of intervals in A with pointwise ukasiewicz negation x=\ α α∈ x\, (truncated) Minkowski sum, x y=\α β α ∈ x,\,\,β∈ y\, pointwise ukasiewicz conjunction x y=( x y), the operators x=[ x, x], ∇ x=[ x, x], and distinguished constants 0=[0,0],\,\, 1=[1,1],\,\,\, i = A. We list a few equations satisfied by the algebra I(A)=(I(A),0,1,i,,,∇,,), call IMV-algebra every model ofthese equations, and show that, conversely, every IMV-algebra is isomorphic to the IMV-algebra I(B) of all intervals in some MV-algebra B. We show that IMV-algebras are categorically equivalent to MV-algebras, and give a representation of free IMV-algebras. We construct ukasiewicz interval logic, with its coNP-complete consequence relation, which we prove to be complete for I([0,1])-valuations. For any class Q of partially ordered algebras with operations that are monotone or antimonotone in each variable, we consider the generalization IQ of the MV-algebraic functor I, and give necessary and sufficient conditions for IQ to be a categorical equivalence. These conditions are satisfied, e.g., by all subquasivarieties of residuated lattices.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.