Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/101794
Title: A Lindström theorem in many-valued modal logic over a finite MTL-chain
Authors: Badia, G.
Olkhovikov, G.
Issue Date: 2020
Publisher: Elsevier B.V.
Citation: Badia G. A Lindström theorem in many-valued modal logic over a finite MTL-chain / G. Badia, G. Olkhovikov. — DOI 10.1016/j.fss.2019.03.002 // Fuzzy Sets and Systems. — 2020. — Vol. 388. — P. 26-37.
Abstract: We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property. © 2019 Elsevier B.V.
Keywords: BISIMULATION
FUZZY LOGIC
LINDSTRÖM THEOREM
MANY-VALUED MODAL LOGIC
MTL-CHAINS
RESIDUATED LATTICES
COMPUTER CIRCUITS
LINEARIZATION
MANY VALUED LOGICS
ABSTRACT LOGIC
BISIMULATIONS
MODAL LANGUAGE
MODAL LOGIC
RESIDUATED LATTICES
STRONG INVARIANCE
FUZZY LOGIC
URI: http://hdl.handle.net/10995/101794
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85062700102
PURE ID: 12654295
2dd86377-e74e-42d1-b6cd-75eda79bf8bb
ISSN: 1650114
DOI: 10.1016/j.fss.2019.03.002
metadata.dc.description.sponsorship: We are grateful to two anonymous referees and the editor of this journal for their numerous and helpful comments. Their help greatly improved the paper. Guillermo Badia is supported by the project I 1923-N25 of the Austrian Science Fund (FWF). Grigory Olkhovikov is supported by Deutsche Forschungsgemeinschaft (DFG), project WA 936/11-1.
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85062700102.pdf624,7 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.