On Standard Completeness for Non-commutative Many-Valued Logics

DOI10.1007/978-3-319-11271-8_14zbMath1351.03017OpenAlexW121200123MaRDI QIDQ2829669

Denisa Diaconescu

Publication date: 8 November 2016

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11271-8_14

zbMATH Keywords

many-valued logicsstandard completeness\(\mathrm{psMTL}^{\mathrm r}\) logicnon-commutative logics

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items

Structural induction in institutions

Cites Work

• Observations on non-commutative fuzzy logic
• Non-commutative Łukasiewicz propositional logic
• Alternative proof of standard completeness theorem for MTL
• Residuated lattices. An algebraic glimpse at substructural logics
• Metamathematics of fuzzy logic
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• A proof of standard completeness for Esteva and Godo's logic MTL
• On the standard and rational completeness of some axiomatic extensions of the monoidal t-norm logic
• A complete many-valued logic with product-conjunction
• Fuzzy logics as the logics of chains
• Non-commutative Product Logic and Probability of Fuzzy Events
• Pseudo-t-norms and pseudo-BL algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item