English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/130428
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

On possibilistic modal logics defined over MTL-chains

AuthorsBou, Félix; Esteva, Francesc ; Godo, Lluis
KeywordsPossibitistic Logic
Many-valued Modal Logic
Fuzzy Logic
Issue Date2015
PublisherSpringer
CitationPetr Hájek on Mathematical fuzzy logic: 225- 244 (2015)
AbstractIn this paper we revisit a 1994 paper by Hájek et al. where a modal logic over a finitely-valued Lukasiewicz logic is defined to capture possibilistic reasoning. In this paper we go further in two aspects: first, we generalize the approach in the sense of considering modal logics over an arbitrary finite MTL-chain, and second, we consider a different possibilistic semantics for the necessity and possibility modal operators. The main result is a completeness proof that exploits similar techniques to the ones involved in Hájek et al.’s previous work.
URIhttp://hdl.handle.net/10261/130428
DOI10.1007/978-3-319-06233-4
Identifiersdoi: 10.1007/978-3-319-06233-4
isbn: 978-3-319-06232-7
Appears in Collections:(IIIA) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.