In this note we exploit a combinatorial characterization of free finitely generated Nilpotent Minimum algebras, to give a constructive proof of the uniform interpolation property for Nilpotent Minimum logic. This method allows us to explicitly compute strongest uniform interpolants in Nilpotent Minimum logic.
Computing Uniform Interpolants in Nilpotent Minimum Logic / D. Valota - In: Multiple-Valued Logic (ISMVL), 2017 IEEE 47th International Symposium on[s.l] : IEEE, 2017. - ISBN 9781509054954. - pp. 242-247 (( Intervento presentato al 47. convegno ISMVL tenutosi a Novi Sad nel 2017 [10.1109/ISMVL.2017.21].
Computing Uniform Interpolants in Nilpotent Minimum Logic
D. Valota
2017
Abstract
In this note we exploit a combinatorial characterization of free finitely generated Nilpotent Minimum algebras, to give a constructive proof of the uniform interpolation property for Nilpotent Minimum logic. This method allows us to explicitly compute strongest uniform interpolants in Nilpotent Minimum logic.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Valota_NM-Interpol_ISMVL2017_2ndV.pdf
accesso riservato
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
262.72 kB
Formato
Adobe PDF
|
262.72 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
