Łukasiewicz–Moisil Algebra
   HOME

TheInfoList



OR:

Łukasiewicz–Moisil algebras (LM''n'' algebras) were introduced in the 1940s by
Grigore Moisil Grigore Constantin Moisil (; 10 January 1906 – 21 May 1973) was a Romanian mathematician, computer pioneer, and list of members of the Romanian Academy, titular member of the Romanian Academy. His research was mainly in the fields of mathematic ...
(initially under the name of Łukasiewicz algebras) in the hope of giving algebraic semantics for the ''n''-valued
Łukasiewicz logic In mathematics and philosophy, Łukasiewicz logic ( , ) is a non-classical, many-valued logic. It was originally defined in the early 20th century by Jan Łukasiewicz as a three-valued logic;Łukasiewicz J., 1920, O logice trójwartościowej (in P ...
. However, in 1956 Alan Rose discovered that for ''n'' ≥ 5, the Łukasiewicz–Moisil algebra does not
model A model is an informative representation of an object, person or system. The term originally denoted the Plan_(drawing), plans of a building in late 16th-century English, and derived via French and Italian ultimately from Latin ''modulus'', a mea ...
the Łukasiewicz logic. A faithful model for the ℵ0-valued (infinitely-many-valued) Łukasiewicz–Tarski logic was provided by C. C. Chang's
MV-algebra In abstract algebra, a branch of pure mathematics, an MV-algebra is an algebraic structure with a binary operation \oplus, a unary operation \neg, and the constant 0, satisfying certain axioms. MV-algebras are the algebraic semantics of Łukasie ...
, introduced in 1958. For the axiomatically more complicated (finite) ''n''-valued Łukasiewicz logics, suitable algebras were published in 1977 by Revaz Grigolia and called MV''n''-algebras. MV''n''-algebras are a subclass of LM''n''-algebras, and the inclusion is strict for ''n'' ≥ 5.Iorgulescu, A.: Connections between MV''n''-algebras and ''n''-valued Łukasiewicz-Moisil algebras—I. Discrete Math. 181, 155–177 (1998) In 1982 Roberto Cignoli published some additional constraints that added to LM''n''-algebras produce proper models for ''n''-valued Łukasiewicz logic; Cignoli called his discovery proper Łukasiewicz algebras. Moisil however, published in 1964 a logic to match his algebra (in the general ''n'' ≥ 5 case), now called Moisil logic. After coming in contact with
Zadeh Zadeh, also Zada, is a Persian patronymic suffix meaning 'descendant of' or 'born of' used in names mainly in Iran and Azerbaijan. Notable people whose names contain 'Zadeh' include: * Lotfi A. Zadeh (1921–2017), mathematician, electrical en ...
's
fuzzy logic Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. It is employed to handle the concept of partial truth, where the truth value may range between completely true and completely ...
, in 1968 Moisil also introduced an infinitely-many-valued logic variant and its corresponding LM''θ'' algebras. Although the Łukasiewicz implication cannot be defined in a LM''n'' algebra for ''n'' ≥ 5, the Heyting implication can be, i.e. LM''n'' algebras are
Heyting algebra In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation ''a'' → ''b'' of '' ...
s; as a result, Moisil logics can also be developed (from a purely logical standpoint) in the framework of Brower’s
intuitionistic logic Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems ...
., Theorem 3.6


Definition

A LM''n'' algebra is a
De Morgan algebra __NOTOC__ In mathematics, a De Morgan algebra (named after Augustus De Morgan, a British mathematician and logician) is a structure ''A'' = (A, ∨, ∧, 0, 1, ¬) such that: * (''A'', ∨, ∧, 0,&nbs ...
(a notion also introduced by Moisil) with ''n''-1 additional unary, "modal" operations: \nabla_1, \ldots, \nabla_, i.e. an algebra of
signature A signature (; from la, signare, "to sign") is a handwritten (and often stylized) depiction of someone's name, nickname, or even a simple "X" or other mark that a person writes on documents as a proof of identity and intent. The writer of a ...
(A, \vee, \wedge, \neg, \nabla_, 0, 1) where ''J'' = . (Some sources denote the additional operators as \nabla^n_ to emphasize that they depend on the order ''n'' of the algebra.Cignoli, R., “The algebras of Lukasiewicz many-valued logic - A historical overview,” in S. Aguzzoli et al.(Eds.), Algebraic and Proof-theoretic Aspects of Non-classical Logics, LNAI 4460, Springer, 2007, 69-83. ) The additional unary operators ∇''j'' must satisfy the following axioms for all ''x'', ''y'' ∈ ''A'' and ''j'', ''k'' ∈ ''J'': # \nabla_j(x \vee y) = (\nabla_j\; x) \vee (\nabla_j\; y) # \nabla_j\;x \vee \neg \nabla_j\;x = 1 # \nabla_j (\nabla_k\;x) = \nabla_k\;x # \nabla_j \neg x = \neg \nabla_\;x # \nabla_1\;x\leq \nabla_2\;x\cdots\leq \nabla_\;x # if \nabla_j\;x = \nabla_j\;y for all ''j'' ∈ ''J'', then ''x'' = ''y''. (The adjective "modal" is related to the ltimately failedprogram of Tarksi and Łukasiewicz to axiomatize
modal logic Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other ...
using many-valued logic.)


Elementary properties

The duals of some of the above axioms follow as properties: * \nabla_j(x \wedge y) = (\nabla_j\; x) \wedge (\nabla_j\; y) * \nabla_j\;x \wedge \neg \nabla_j\;x = 0 Additionally: \nabla_j\;0 =0 and \nabla_j\;1 =1. In other words, the unary "modal" operations \nabla_j are lattice
endomorphism In mathematics, an endomorphism is a morphism from a mathematical object to itself. An endomorphism that is also an isomorphism is an automorphism. For example, an endomorphism of a vector space is a linear map , and an endomorphism of a g ...
s.


Examples

LM2 algebras are the
Boolean algebra In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas in e ...
s. The canonical Łukasiewicz algebra \mathcal_n that Moisil had in mind were over the set ''L_n'' = with negation \neg x = 1-x conjunction x \wedge y = \min\ and disjunction x \vee y = \max\ and the unary "modal" operators: :\nabla_j\left(\frac\right)= \; \begin 0 & \mbox i+j < n \\ 1 & \mbox i+j \geq n \\ \end \quad i \in \ \cup J,\; j \in J. If ''B'' is a Boolean algebra, then the algebra over the set ''B'' /sup> ≝ with the lattice operations defined
pointwise In mathematics, the qualifier pointwise is used to indicate that a certain property is defined by considering each value f(x) of some function f. An important class of pointwise concepts are the ''pointwise operations'', that is, operations defined ...
and with ¬(''x'', ''y'') ≝ (¬''y'', ¬''x''), and with the unary "modal" operators ∇2(''x'', ''y'') ≝ (''y'', ''y'') and ∇1(''x'', ''y'') = ¬∇2¬(''x'', ''y'') = (''x'', ''x'') erived by axiom 4is a three-valued Łukasiewicz algebra.


Representation

Moisil proved that every LM''n'' algebra can be embedded in a
direct product In mathematics, one can often define a direct product of objects already known, giving a new one. This generalizes the Cartesian product of the underlying sets, together with a suitably defined structure on the product set. More abstractly, one ta ...
(of copies) of the canonical \mathcal_n algebra. As a corollary, every LM''n'' algebra is a
subdirect product In mathematics, especially in the areas of abstract algebra known as universal algebra, group theory, ring theory, and module theory, a subdirect product is a subalgebra of a direct product that depends fully on all its factors without however ne ...
of
subalgebra In mathematics, a subalgebra is a subset of an algebra, closed under all its operations, and carrying the induced operations. "Algebra", when referring to a structure, often means a vector space or module equipped with an additional bilinear operat ...
s of \mathcal_n. The Heyting implication can be defined as: :x \Rightarrow y\; \overset\;y \vee \bigwedge_(\neg\nabla_j\;x) \vee (\nabla_j\;y) Antonio Monteiro showed that for every
monadic Boolean algebra In abstract algebra, a monadic Boolean algebra is an algebraic structure ''A'' with signature :⟨·, +, ', 0, 1, ∃⟩ of type ⟨2,2,1,0,0,1⟩, where ⟨''A'', ·, +, ', 0, 1⟩ is a Boolean algebra. The monadic/unary ...
one can construct a trivalent Łukasiewicz algebra (by taking certain equivalence classes) and that any trivalent Łukasiewicz algebra is isomorphic to a Łukasiewicz algebra thus derived from a monadic Boolean algebra.Monteiro, Antóni
"Sur les algèbres de Heyting symétriques."
Portugaliae mathematica 39.1–4 (1980): 1–237. Chapter 7. pp. 204-206
Cignoli summarizes the importance of this result as: "Since it was shown by Halmos that monadic Boolean algebras are the algebraic counterpart of classical first order monadic calculus, Monteiro considered that the representation of three-valued Łukasiewicz algebras into monadic Boolean algebras gives a proof of the consistency of Łukasiewicz three-valued logic relative to classical logic."


References


Further reading

* * Boicescu, V., Filipoiu, A., Georgescu, G., Rudeanu, S.: Łukasiewicz-Moisil Algebras. North-Holland, Amsterdam (1991) * Iorgulescu, A.: Connections between MV''n''-algebras and ''n''-valued Łukasiewicz–Moisil algebras—II. Discrete Math. 202, 113–134 (1999) * Iorgulescu, A.: Connections between MV''n''-algebras and ''n''-valued Łukasiewicz-Moisil—III. Unpublished Manuscript * Iorgulescu, A.: Connections between MV''n''-algebras and ''n''-valued Łukasiewicz–Moisil algebras—IV. J. Univers. Comput. Sci. 6, 139–154 (2000) * R. Cignoli, Algebras de Moisil de orden n, Ph.D. Thesis, Universidad National del Sur, Bahia Blanca, 1969 * http://projecteuclid.org/download/pdf_1/euclid.ndjfl/1093635424 {{DEFAULTSORT:Lukasiewicz-Moisil algebra Algebraic logic Ockham algebras