Provability, Computability and Reflection.

BL-algebras are the Lindenbaum algebras for Hájek's Basic Logic, just as Boolean algebras correspond to the classical propositional calculus. The finite totally ordered BL-algebras are ordinal sums of MV-chains. We develop a natural duality, in the sense of Davey and Werner, for each subvariety generated by a finite BL-chain, and we use it to describe the injective and the weak injective members of these classes.

Proper n-valued ukasiewicz algebras are obtained by adding some binary operators, fulfilling some simple equations, to the fundamental operations of n-valued ukasiewicz algebras. They are the s-algebras corresponding to an axiomatization of ukasiewicz n-valued propositional calculus that is an extention of the intuitionistic calculus.

The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.