论文信息 - Alternative Proof of Standard Completeness Theorem for MTL

Alternative Proof of Standard Completeness Theorem for MTL

As it was shown in Jenei and Montagna (Studia Logica 70(2): 183–192, 2002), Monoidal t-norm based logic (MTL) is a logic of left-continuous t-norms. In other words, this means that MTL enjoys the standard completeness theorem. In this paper we present a different proof of this theorem. In fact, we prove even more since we show that MTL is complete w.r.t. the class of standard MTL-algebras with finite congruence lattice or equivalently with finitely many Archimedean classes. We also show the connection between the congruence lattice of an MTL-chain and its Archimedean classes.

Rostislav Horcík

[1] Franco Montagna,et al. On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic , 2002, Stud Logica.

[2] Rostislav Horcík. Standard completeness theorem for ΠMTL , 2005, Arch. Math. Log..

[3] Willem J. Blok,et al. The finite embeddability property for residuated lattices, pocrims and BCK-algebras , 2002, Reports Math. Log..

[4] Karel Hrbacek,et al. Introduction to Set Theory , 1978 .

[5] Lluis Godo,et al. Monoidal t-norm based logic: towards a logic for left-continuous t-norms , 2001, Fuzzy Sets Syst..

[6] Constantine Tsinakis,et al. The Structure of Residuated Lattices , 2003, Int. J. Algebra Comput..

[7] Franco Montagna,et al. A Proof of Standard Completeness for Esteva and Godo's Logic MTL , 2002, Stud Logica.