English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160968
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


On rational weak Nilpotent Minimum logics

AuthorsEsteva, Francesc ; Godo, Lluis ; Noguera, Carles
KeywordsRational Pavelka logic
Gödel logic
Rational weak nilpotent minimum logic
Rational Gödel logic
Weak nilpotent minimum
Issue Date2006
PublisherOld City Publishing
CitationJournal of Multiple-Valued Logic and Soft Computing 12: 9- 32 (2006)
AbstractIn this paper we investigate extensions of Gödel and Nilpotent Minimum logics by adding rational truth-values as truth constants in the language and by adding corresponding book-keeping axioms for the truth-constants. We also investigate the rational extensions of some parametric families of Weak Nilpotent Minimum logics, weaker than both Gödel and Nilpotent Minimum logics. Weak and strong standard completeness of these logics are studied in general and in particular when we restrict ourselves to formulas of the kind r̄ → φ, where r is a rational in [0, 1] and φ is a formula without rational truth-constants. © 2006 Old City Publishing, Inc.
Identifiersissn: 1542-3980
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
JMVLSC12(2006)_9-32.pdf265,9 kBAdobe PDFThumbnail
Show full item record
Review this work

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