Density revisited

Metcalfe, George; Tsinakis, Constantine (2017). Density revisited. Soft computing, 21(1), pp. 175-189. Springer 10.1007/s00500-016-2420-7

Preview	Text MTdensity_revised.pdf - Accepted Version Available under License Publisher holds Copyright. Download (357kB) | Preview
Preview	Text art_10.1007_s00500-016-2420-7-1.pdf - Published Version Available under License Publisher holds Copyright. Download (504kB) | Preview

In this (part survey) paper,we revisit algebraic and proof-theoretic methods developed by Franco Montagna and his co-authors for proving that the chains (totally ordered members) of certain varieties of semilinear residuated lattices
embed into dense chains of these varieties, a key step in establishing standard completeness results for fuzzy logics. Such “densifiable” varieties are precisely the varieties that are generated as quasivarieties by their dense chains.By showing that all dense chains satisfy a certain e-cyclicity equation, we give a short proof that the variety of all semilinear residuated lattices is not densifiable (first proved by Wang and Zhao). We then adapt the Jenei–Montagna standard completeness proof for monoidal t-norm logic to show that any variety of integral semilinear residuated lattices axiomatized by additional lattice-ordered monoid equations is densifiable. We also generalize known results to show that certain varieties of cancellative semilinear residuated lattices are densifiable. Finally, we revisit the Metcalfe–Montagna proof-theoretic approach, which establishes densifiability of a variety via
the elimination of a density rule for a suitable hypersequent calculus, focussing on the case of commutative semilinear residuated lattices.

Interest & Impact

Downloads

212 since deposited on 26 Apr 2017
26 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item