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

Denisa Diaconescu

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

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

Topics: Approximate Reasoning and Fuzzy Inference; Mathematical Foundations: Fuzzy Set Theory and Fuzzy Logic

In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, 350-356, 2012 , Barcelona, Spain

Author: Denisa Diaconescu

Affiliation: University of Bucharest, Romania

Keyword(s): Non-commutative Fuzzy Logic, psMTL Logic, Standard Semantics.

Related Ontology Subjects/Areas/Topics: Approximate Reasoning and Fuzzy Inference ; Artificial Intelligence ; Computational Intelligence ; Fuzzy Systems ; Mathematical Foundations: Fuzzy Set Theory and Fuzzy Logic ; Soft Computing

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.145.119.199

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 (IJCCI 2012) - FCTA; ISBN 978-989-8565-33-4; ISSN 2184-3236, SciTePress, pages 350-356. DOI: 10.5220/0004151603500356

@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 (IJCCI 2012) - FCTA},
year={2012},
pages={350-356},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004151603500356},
isbn={978-989-8565-33-4},
issn={2184-3236},
}

TY - CONF

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