Singly and doubly even: Difference between revisions

Revision as of 00:36, 4 December 2013

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 Łukasiewicz logic; the letters MV refer to many-valued logic of Łukasiewicz. MV-algebras coincide with the class of bounded commutative BCK algebras.

Definitions

An MV-algebra is an algebraic structure $\langle A,\oplus ,\lnot ,0\rangle ,$ consisting of

a non-empty set $A,$
a binary operation $\oplus$ on $A,$
a unary operation $\lnot$ on $A,$ and
a constant $0$ denoting a fixed element of $A,$

which satisfies the following identities:

By virtue of the first three axioms, $\langle A,\oplus ,0\rangle$ is a commutative monoid. Being defined by identities, MV-algebras form a variety of algebras. The variety of MV-algebras is a subvariety of the variety of BL-algebras and contains all Boolean algebras.

An MV-algebra can equivalently be defined (Hájek 1998) as a prelinear commutative bounded integral residuated lattice $\langle L,\wedge ,\vee ,\otimes ,\rightarrow ,0,1\rangle$ satisfying the additional identity $x\vee y=(x\rightarrow y)\rightarrow y.$

Examples of MV-algebras

A simple numerical example is $A=[0,1],$ with operations $x\oplus y=\min(x+y,1)$ and $\lnot x=1-x.$ In mathematical fuzzy logic, this MV-algebra is called the standard MV-algebra, as it forms the standard real-valued semantics of Łukasiewicz logic.

The trivial MV-algebra has the only element 0 and the operations defined in the only possible way, $0\oplus 0=0$ and $\lnot 0=0.$

The two-element MV-algebra is actually the two-element Boolean algebra $\{0,1\},$ with $\oplus$ coinciding with Boolean disjunction and $\lnot$ with Boolean negation. In fact adding the axiom $x\oplus x=x$ to the axioms defining an MV-algebra results in an axiomantization of Boolean algebras.

If instead the axiom added is $x\oplus x\oplus x=x\oplus x$ , then the axioms define the MV₃ algebra corresponding to the three-valued Łukasiewicz logic Ł₃Potter or Ceramic Artist Truman Bedell from Rexton, has interests which include ceramics, best property developers in singapore developers in singapore and scrabble. Was especially enthused after visiting Alejandro de Humboldt National Park.. Other finite linearly ordered MV-algebras are obtained by restricting the universe and operations of the standard MV-algebra to the set of $n$ equidistant real numbers between 0 and 1 (both included), that is, the set $\{0,1/(n-1),2/(n-1),\dots ,1\},$ which is closed under the operations $\oplus$ and $\lnot$ of the standard MV-algebra; these algebras are usually denoted MV_n.

Another important example is Chang's MV-algebra, consisting just of infinitesimals (with the order type ω) and their co-infinitesimals.

Chang also constructed an MV-algebra from an arbitrary totally ordered abelian group G by fixing a positive element u and defining the segment [0, u] as { x ∈ G | 0 ≤ x ≤ u }, which becomes an MV-algebra with x ⊕ y = min(u, x+y) and ¬x = u−x. Furthermore, Chang showed that every linearly ordered MV-algebra is isomorphic to an MV-algebra constructed from a group in this way.

D. Mundici extended the above construction to abelian lattice-ordered groups. If G is such a group with strong (order) unit u, then the "unit interval" { x ∈ G | 0 ≤ x ≤ u } can be equipped with ¬x = u−x, x ⊕ y = u∧_G (x+y), x ⊗ y = 0∨_G(x+y−u). This construction establishes a categorical equivalence between lattice-ordered abelian groups with strong unit and MV-algebras.

Relation to Łukasiewicz logic

C. C. Chang devised MV-algebras to study many-valued logics, introduced by Jan Łukasiewicz in 1920. In particular, MV-algebras form the algebraic semantics of Łukasiewicz logic, as described below.

Given an MV-algebra A, an A-valuation is a homomorphism from the algebra of propositional formulas (in the language consisting of $\oplus ,\lnot ,$ and 0) into A. Formulas mapped to 1 (or $\lnot$ 0) for all A-valuations are called A-tautologies. If the standard MV-algebra over [0,1] is employed, the set of all [0,1]-tautologies determines so-called infinite-valued Łukasiewicz logic.

Chang's (1958, 1959) completeness theorem states that any MV-algebra equation holding in the standard MV-algebra over the interval [0,1] will hold in every MV-algebra. Algebraically, this means that the standard MV-algebra generates the variety of all MV-algebras. Equivalently, Chang's completeness theorem says that MV-algebras characterize infinite-valued Łukasiewicz logic, defined as the set of [0,1]-tautologies.

The way the [0,1] MV-algebra characterizes all possible MV-algebras parallels the well-known fact that identities holding in the two-element Boolean algebra hold in all possible Boolean algebras. Moreover, MV-algebras characterize infinite-valued Łukasiewicz logic in a manner analogous to the way that Boolean algebras characterize classical bivalent logic (see Lindenbaum-Tarski algebra).

Relation to functional analysis

Template:Expand section MV-algebras were related by D. Mundici to approximately finite dimensional C*-algebras by establishing a bijective correspondence between all isomorphism classes of AF C*-algebras with lattice-ordered dimension group and all isomorphism classes of countable MV algebras. Some instances of this correspondence include:

Countable MV algebra	AF C*-algebra
{0, 1}	ℂ
{0, 1/n, ..., 1 }	M_n(ℂ), i.e. n×n complex matrices
finite	finite-dimensional
boolean	commutative

In software

There are multiple frameworks implementing fuzzy logic (type II), and most of them implement what has been called a multi-adjoint logic. This is no more than the implementation of a MV-algebra. More information available at Multi-adjoint logic programming.

References

Chang, C. C. (1958) "Algebraic analysis of many-valued logics," Transactions of the American Mathematical Society 88: 476–490.
------ (1959) "A new proof of the completeness of the Lukasiewicz axioms," Transactions of the American Mathematical Society 88: 74–80.
Cignoli, R. L. O., D'Ottaviano, I. M. L., Mundici, D. (2000) Algebraic Foundations of Many-valued Reasoning. Kluwer.
Di Nola A., Lettieri A. (1993) "Equational characterization of all varieties of MV-algebras," Journal of Algebra 221: 123–131.
Hájek, Petr (1998) Metamathematics of Fuzzy Logic. Kluwer.
Mundici, D.: Interpretation of AF C*-algebras in Łukasiewicz sentential calculus. J. Funct. Anal. 65, 15–63 (1986) 21 year-old Glazier James Grippo from Edam, enjoys hang gliding, industrial property developers in singapore developers in singapore and camping. Finds the entire world an motivating place we have spent 4 months at Alejandro de Humboldt National Park.

External links

Stanford Encyclopedia of Philosophy: "Many-valued logic" -- by Siegfried Gottwald.

@@ Line 1: / Line 1: @@
-The writer's title is Christy. My working day occupation is a travel agent. The favorite pastime for him and his kids is to perform lacross and  best psychic - [http://Gcjcteam.org/index.php?mid=etc_video&document_srl=696611&sort_index=regdate&order_type=desc simply click the up coming article] - he would by no means give it up. Her family members lives  [http://myfusionprofits.com/groups/find-out-about-self-improvement-tips-here/ are psychics real] in Ohio.<br><br>Feel free to surf to my page :: online reader; [http://koreanyelp.com/index.php?document_srl=1798&mid=SchoolNews Privacy of Data: This tool is built-with and functions-in Client Side JavaScripting, so only your computer will see or process your data input/output.a cool way to improve],
+In [[abstract algebra]], a branch of pure [[mathematics]], an '''MV-algebra''' is an [[algebraic structure]] with a [[binary operation]] <math>\oplus</math>, a [[unary operation]] <math>\neg</math>, and the constant <math>0</math>, satisfying certain axioms. MV-algebras are the [[Algebraic semantics (mathematical logic)|algebraic semantics]] of [[Łukasiewicz logic]]; the letters MV refer to ''many-valued'' logic of Łukasiewicz. MV-algebras coincide with the class of bounded commutative [[BCK algebra]]s.
+==Definitions==
+An '''MV-algebra''' is an [[algebraic structure]] <math>\langle A, \oplus, \lnot, 0\rangle,</math> consisting of
+* a [[empty set|non-empty]] [[Set (mathematics)|set]] <math>A,</math>
+* a [[binary operation]] <math>\oplus</math> on <math>A,</math>
+* a [[unary operation]] <math>\lnot</math> on <math>A,</math> and
+* a constant <math>0</math> denoting a fixed [[element (mathematics)|element]] of <math>A,</math>
+which satisfies the following [[identity (mathematics)|identities]]:
+* <math> (x \oplus y) \oplus z = x \oplus (y \oplus z),</math>
+* <math> x \oplus 0 = x,</math>
+* <math> x \oplus y = y \oplus x,</math>
+* <math> \lnot \lnot x = x,</math>
+* <math> x \oplus \lnot 0 = \lnot 0,</math> and
+* <math> \lnot ( \lnot x \oplus y)\oplus y = \lnot ( \lnot y \oplus x) \oplus x.</math>
+By virtue of the first three axioms, <math>\langle A, \oplus, 0 \rangle</math> is a commutative [[monoid]]. Being defined by identities, MV-algebras form a [[variety (universal algebra)|variety]] of algebras. The variety of MV-algebras is a subvariety of the variety of [[BL (logic)|BL]]-algebras and contains all [[Boolean algebra (structure)|Boolean algebra]]s.
+An MV-algebra can equivalently be defined (Hájek 1998) as a prelinear commutative bounded integral [[residuated lattice]] <math>\langle L, \wedge, \vee, \otimes, \rightarrow, 0, 1 \rangle </math> satisfying the additional identity <math>x \vee y = (x \rightarrow y) \rightarrow y.</math>
+==Examples of MV-algebras==
+A simple numerical example is <math>A=[0,1],</math> with operations <math>x \oplus y = \min(x+y,1)</math> and <math>\lnot x=1-x.</math> In mathematical fuzzy logic, this MV-algebra is called the ''standard MV-algebra'', as it forms the standard real-valued semantics of [[Łukasiewicz logic]].
+The ''trivial'' MV-algebra has the only element 0 and the operations defined in the only possible way, <math>0\oplus0=0</math> and <math>\lnot0=0.</math>
+The ''two-element'' MV-algebra is actually the [[two-element Boolean algebra]] <math>\{0,1\},</math> with <math>\oplus</math> coinciding with Boolean disjunction and <math>\lnot</math> with Boolean negation. In fact adding the axiom <math>x \oplus x = x</math> to the axioms defining an MV-algebra results in an axiomantization of Boolean algebras.
+If instead the axiom added is <math>x \oplus x \oplus x = x \oplus x</math>, then the axioms define the MV<sub>3</sub> algebra corresponding to the three-valued Łukasiewicz logic Ł<sub>3</sub>{{Citation needed|reason=Axiomatizations of Ln need Grigolia's axioms|date=February 2013}}. Other finite linearly ordered MV-algebras are obtained by restricting the universe and operations of the standard MV-algebra to the set of <math>n</math> equidistant real numbers between 0 and 1 (both included), that is, the set <math>\{0,1/(n-1),2/(n-1),\dots,1\},</math> which is closed under the operations <math>\oplus</math> and <math>\lnot</math> of the standard MV-algebra; these algebras are usually denoted MV<sub>n</sub>.
+Another important example is ''Chang's MV-algebra'', consisting just of infinitesimals (with the [[order type]] &omega;) and their co-infinitesimals.
+Chang also constructed an MV-algebra from an arbitrary [[Linearly ordered group|totally ordered abelian group]] ''G'' by fixing a positive element ''u'' and defining the segment [0, ''u''] as { ''x'' ∈ ''G'' | 0 ≤ ''x'' ≤ ''u'' }, which becomes an MV-algebra with ''x'' ⊕ ''y'' = min(''u'', ''x''+''y'') and ¬''x'' = ''u''−''x''. Furthermore, Chang showed that every linearly ordered MV-algebra is isomorphic to an MV-algebra constructed from a group in this way.
+D. Mundici extended the above construction to abelian [[lattice-ordered group]]s. If ''G'' is such a group with strong (order) unit ''u'', then the "unit interval" { ''x'' ∈ ''G'' | 0 ≤ ''x'' ≤ ''u'' } can be equipped with ¬''x'' = ''u''−''x'', ''x'' ⊕ ''y'' = ''u''∧<sub>G</sub> (x+y), ''x'' ⊗ ''y'' = 0∨<sub>G</sub>(''x''+''y''−''u''). This construction establishes a [[categorical equivalence]] between lattice-ordered abelian groups with strong unit and MV-algebras.
+==Relation to Łukasiewicz logic==
+[[C. C. Chang]] devised MV-algebras to study [[many-valued logic]]s, introduced by [[Jan Łukasiewicz]] in 1920. In particular, MV-algebras form the [[algebraic semantics (mathematical logic)|algebraic semantics]] of [[Łukasiewicz logic]], as described below.
+Given an MV-algebra ''A'', an ''A''-[[Valuation (logic)|valuation]] is a [[homomorphism]] from the algebra of [[propositional formula]]s (in the language consisting of <math>\oplus,\lnot,</math> and 0) into ''A''. Formulas mapped to 1 (or <math>\lnot</math>0) for all ''A''-valuations are called ''A''-[[tautology (logic)|tautologies]]. If the standard MV-algebra over [0,1] is employed, the set of all [0,1]-tautologies determines so-called infinite-valued [[Łukasiewicz logic]].
+Chang's (1958, 1959) completeness theorem states that any MV-algebra equation holding in the standard MV-algebra over the interval [0,1] will hold in every MV-algebra. Algebraically, this means that the standard MV-algebra generates the variety of all MV-algebras. Equivalently, Chang's completeness theorem says that MV-algebras characterize infinite-valued [[Łukasiewicz logic]], defined as the set of [0,1]-tautologies.
+The way the [0,1] MV-algebra characterizes all possible MV-algebras parallels the well-known fact that identities holding in the [[two-element Boolean algebra]] hold in all possible Boolean algebras. Moreover, MV-algebras characterize infinite-valued [[Łukasiewicz logic]] in a manner analogous to the way that [[Boolean algebras]] characterize classical [[two-element Boolean algebra|bivalent logic]] (see [[Lindenbaum-Tarski algebra]]).
+==Relation to functional analysis==
+{{expand section|date=November 2012}}
+MV-algebras were related by D. Mundici to [[approximately finite dimensional C*-algebra]]s by establishing a bijective correspondence between all isomorphism classes of AF C*-algebras with lattice-ordered dimension group and all isomorphism classes of countable MV algebras. Some instances of this correspondence include:
+{| class="wikitable"
+|-
+! Countable MV algebra !! AF C*-algebra
+|-
+| {0, 1} || ℂ
+|-
+| {0, 1/''n'', ..., 1 } || M<sub>n</sub>(ℂ), i.e. ''n''×''n'' complex matrices
+|-
+| finite || finite-dimensional
+|-
+| boolean || commutative
+|}
+==In software==
+There are multiple frameworks implementing fuzzy logic (type II),
+and most of them implement what has been called a multi-adjoint logic.
+This is no more than the implementation of a '''MV-algebra'''.
+More information available at [[Multi-adjoint logic programming]].
+==References==
+*Chang, C. C. (1958) "Algebraic analysis of many-valued logics," ''Transactions of the American Mathematical Society'' '''88''': 476–490.
+*------ (1959) "A new proof of the completeness of the Lukasiewicz axioms," ''Transactions of the American Mathematical Society'' '''88''': 74–80.
+* Cignoli, R. L. O., D'Ottaviano, I. M. L., Mundici, D. (2000) ''Algebraic Foundations of Many-valued Reasoning''. Kluwer.
+* Di Nola A., Lettieri A. (1993) "Equational characterization of all varieties of MV-algebras," ''Journal of Algebra'' '''221''': 123–131.
+* Hájek, Petr (1998) ''Metamathematics of Fuzzy Logic''. Kluwer.
+* Mundici, D.: Interpretation of AF C*-algebras in Łukasiewicz sentential calculus. J. Funct. Anal. 65, 15–63 (1986) {{doi|10.1016/0022-1236(86)90015-7}}
+==Further reading ==
+* {{cite book|author=D. Mundici|title=Advanced Łukasiewicz calculus and MV-algebras|year=2011|publisher=Springer|isbn=978-94-007-0839-6}}
+==External links==
+* [[Stanford Encyclopedia of Philosophy]]: "[http://plato.stanford.edu/entries/logic-manyvalued/  Many-valued logic]" -- by [[Siegfried Gottwald]].
+[[Category:Algebraic logic]]
+[[Category:Algebraic structures]]
+[[Category:Fuzzy logic]]
+[[Category:Many-valued logic]]

Singly and doubly even: Difference between revisions

Revision as of 00:36, 4 December 2013

Contents

Definitions

Examples of MV-algebras

Relation to Łukasiewicz logic

Relation to functional analysis

In software

References

Further reading

External links

Navigation menu

Singly and doubly even: Difference between revisions

Revision as of 00:36, 4 December 2013

Definitions

Examples of MV-algebras

Relation to Łukasiewicz logic

Relation to functional analysis

In software

References

Further reading

External links

Navigation menu

Search