Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions

Authors:
Agata Ciabattoni;George Metcalfe;Franco Montagna
Affiliations:
University of Technology, Vienna, Austria;Department of Mathematics, University of Bern, Switzerland;Department of Mathematics, University of Siena, Italy
Venue:
Fuzzy Sets and Systems
Year:
2010

Citing 8
Cited 4

Linear logic

Theoretical Computer Science
Storage Operators and Multiplicative Quantifiers in Many-valued Logics

Journal of Logic and Computation
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
From Axioms to Analytic Rules in Nonclassical Logics

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Density elimination

Theoretical Computer Science
Proof Theory for Fuzzy Logics

Proof Theory for Fuzzy Logics
Proof Systems for a Gödel Modal Logic

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice

Journal of Logic and Computation

Expanding Basic Fuzzy Logic with truth constants for component delimiters

Fuzzy Sets and Systems
A logical approach to fuzzy truth hedges

Information Sciences: an International Journal
Modal MTL-algebras

Fuzzy Sets and Systems
From Frame Properties to Hypersequent Rules in Modal Logics

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.21

Visualization

Abstract

Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and ''very true'' are presented here both algebraically in the framework of residuated lattices and proof-theoretically as hypersequent calculi. Completeness with respect to standard algebras based on t-norms, embeddings between logics, decidability, and the finite embedding property are then investigated for these logics.