Łukasiewicz implication algebras are the {→,1}-subreducts of MV- algebras. They are the algebraic counterpart of Super-Łukasiewicz Implicational Logics investigated in Komori (Nogoya Math J 72:127–133, 1978). In this paper we give a description of free Łukasiewicz implication algebras in the context of McNaughton functions. More precisely, we show that the |X|-free Łukasiewicz implication algebra is isomorphic to ${\bigcup_{x\in X} [x_\theta)}$ for a certain congruence θ over the |X|-free MV-algebra. As corollary we describe the free algebras in all subvarieties of Łukasiewicz (...) implication algebras. (shrink)

ABSTRACT We characterize, for every subvariety V of the variety of all MV- algebras, the free objects in V. We use our results to compute coproducts in V and to provide simple single-axiom axiomatizations of all many-valued logics extending the Lukasiewicz one.

We classify every finitely axiomatizable theory in infinite-valued propositional Łukasiewicz logic by an abstract simplicial complex equipped with a weight function . Using the Włodarczyk–Morelli solution of the weak Oda conjecture for toric varieties, we then construct a Turing computable one–one correspondence between equivalence classes of weighted abstract simplicial complexes, and equivalence classes of finitely axiomatizable theories, two theories being equivalent if their Lindenbaum algebras are isomorphic. We discuss the relationship between our classification and Markov’s undecidability theorem for PL-homeomorphism of (...) rational polyhedra. (shrink)

In classical propositional logic, a theory T is prime iff it is complete. In Łukasiewicz infinite-valued logic the two notions split, completeness being stronger than primeness. Using toric desingularization algorithms and the fine structure of prime ideal spaces of free ℓ -groups, in this paper we shall characterize prime theories in infinite-valued logic. We will show that recursively enumerable prime theories over a finite number of variables are decidable, and we will exhibit an example of an undecidable r.e. prime theory (...) over countably many variables. (shrink)

Mundici has recently established a characterization of free finitely generated MV-algebras similar in spirit to the representation of the free Boolean algebra with a countably infinite set of free generators as any Boolean algebra that is countable and atomless. No reference to universal properties is made in either theorem. Our main result is an extension of Mundici’s theorem to the whole class of MV-algebras that are free over some finite distributive lattice.

Formulas of n variables of Łukasiewicz sentential calculus can be represented, via McNaughton’s theorem, by piecewise linear functions, with integer coefficients, from hypercube [0,1] n to [0,1], called McNaughton functions. As a consequence of the McNaughton representation of a formula it is obtained a canonical form of a formula. Indeed, up to logical equivalence, any formula can be written as an infimum of finite suprema of formulas associated to McNaughton functions which are truncated functions to $[0,1]$ of the restriction to (...) [0,1] n of single hyperplanes, for short, called simple McNaughton functions. In the present paper we will concern with the problem of presenting formulas of Lukasiewicz sentential calculus in normal form. Here we list the main results we obtained: a) we give an axiomatic description of some classes of formulas having the property to be canonically mapped one-to-one onto the class of simple Mc Naughton functions; b) we provide normal forms for Lukasiewicz sentential calculus, making use of formulas defined in a); c) we prove the polynomial complexity of formulas, in normal form, coming from a certain class described as in a); d) we extend the results described in a), b) and c) to Rational Lukasiewicz logic. (shrink)

The MV-algebra S m w is obtained from the (m+1)-valued ukasiewicz chain by adding infinitesimals, in the same way as Chang's algebra is obtained from the two-valued chain. These algebras were introduced by Komori in his study of varieties of MV-algebras. In this paper we describe the finitely generated totally ordered algebras in the variety MV m w generated by S m w . This yields an easy description of the free MV m w -algebras over one generator. We characterize (...) the automorphism groups of the free MV-algebras over finitely many generators. (shrink)

We prove that the m -generated free MV-algebra is isomorphic to a quotient of the disjoint union of all the m -generated free MV-algebras. Such a quotient can be seen as the direct limit of a system consisting of all free MV-algebras and special maps between them as morphisms.

We establish the Robinson joint consistency theorem for the infinite-valued propositional logic of Łukasiewicz. As a corollary we easily obtain the amalgamation property for MV-algebras—the algebras of Łukasiewicz logic: all pre-existing proofs of this latter result make essential use of the Pierce amalgamation theorem for abelian lattice-ordered groups together with the categorical equivalence Γ between these groups and MV-algebras. Our main tools are elementary and geometric.