Non-commutative Fuzzy Logic psMTL - An Alternative Proof for the Standard Completeness Theorem

Denisa Diaconescu

2012

Abstract

In (Jenei and Montagna, 2003) was proved that the non-commutative psMTL logic introduced in (Hájek, 2003b) is the logic of left-continuous non-commutative t-norms or, equivalently, that the logic psMTL enjoys standard completeness. In the present paper we provide an alternative proof for the standard completeness theorem for the logic psMTL and we furthermore show that this result can be obtained also for finite theories.

Paper Citation

in Harvard Style

Diaconescu D. (2012). Non-commutative Fuzzy Logic psMTL - An Alternative Proof for the Standard Completeness Theorem . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 350-356. DOI: 10.5220/0004151603500356

in Bibtex Style

@conference{fcta12,
author={Denisa Diaconescu},
title={Non-commutative Fuzzy Logic psMTL - An Alternative Proof for the Standard Completeness Theorem},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012)},
year={2012},
pages={350-356},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004151603500356},
isbn={978-989-8565-33-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012)
TI - Non-commutative Fuzzy Logic psMTL - An Alternative Proof for the Standard Completeness Theorem
SN - 978-989-8565-33-4
AU - Diaconescu D.
PY - 2012
SP - 350
EP - 356
DO - 10.5220/0004151603500356