Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0. 1]. In this paper, we introduce Uninorm logic UL as Multi plicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom. Axiomatic extensions of UL include known fuzzy logics such as Monoidal i-norm logic MTL and Goedel logic G and new weakening-free logics. Algebraic semantics for these logics are provided by subvarieties of (representable) pointed bounded commutative residuated lattices. Gentzen systems admitting cut-elimination are given in the framework of hypersequents. Completeness with respect to algebras with lattice reduct [0,1] is established for UL and several extensions using a two-part strategy. First, completeness is proved for the logic extended with Takeuti and Titani's density rule. A syntactic elimination of the rule is then given using a hypersequent calculus. As an algebraic corollary, it follows that certain varieties of residuated lattices are generated by their members with lattice reduct [0. 1].
Metcalfe, G., Montagna, F. (2007). Substructural Fuzzy Logics. THE JOURNAL OF SYMBOLIC LOGIC, 72(3), 834-864 [10.2178/jsl/1191333844].
Substructural Fuzzy Logics
Montagna F.
2007-01-01
Abstract
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0. 1]. In this paper, we introduce Uninorm logic UL as Multi plicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom. Axiomatic extensions of UL include known fuzzy logics such as Monoidal i-norm logic MTL and Goedel logic G and new weakening-free logics. Algebraic semantics for these logics are provided by subvarieties of (representable) pointed bounded commutative residuated lattices. Gentzen systems admitting cut-elimination are given in the framework of hypersequents. Completeness with respect to algebras with lattice reduct [0,1] is established for UL and several extensions using a two-part strategy. First, completeness is proved for the logic extended with Takeuti and Titani's density rule. A syntactic elimination of the rule is then given using a hypersequent calculus. As an algebraic corollary, it follows that certain varieties of residuated lattices are generated by their members with lattice reduct [0. 1].File | Dimensione | Formato | |
---|---|---|---|
MMjsl07.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
2.22 MB
Formato
Adobe PDF
|
2.22 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/23722
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo