Algebraic Logic for Rational Pavelka Predicate Calculus
Daniel Drăgulici, George Georgescu · Mathematical logic quarterly · 2001
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∀.