Abstract | ||
---|---|---|
In this paper we investigate extensions of Godel 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 Godel 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) over bar -> phi, where r is a rational in [0, 1] and phi is a formula without rational truth-constants. |
Year | DOI | Venue |
---|---|---|
2006 | 10.13039/501100006280 | JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING |
Keywords | Field | DocType |
Godel logic,weak Nilpotent Minimum,rational Pavelka logic,rational Godel logic,rational weak Nilpotent Minimum logic | Algebra,Nilpotent group,Computer science,Gödel logic,Completeness (statistics),Nilpotent | Journal |
Volume | Issue | ISSN |
12 | 1-2 | 1542-3980 |
Citations | PageRank | References |
18 | 1.34 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Francesc Esteva | 1 | 1885 | 200.14 |
Lluis Godo | 2 | 1392 | 173.03 |
Carles Noguera | 3 | 462 | 33.93 |