We introduce a propositional many-valued modal logic which is an extension of the Continuous Propositional Logic to a modal system. Otherwise said, we extend the minimal modal logic K to a Continuous Logic system. After introducing semantics, axioms and deduction rules, we establish some preliminary results. Then we prove the equivalence between consistency and satisfiability. As straightforward consequences, we get compactness, an approximated completeness theorem, in the vein of Continuous Logic, and a Pavelka-style completeness theorem.
Continuous propositional modal logic / Baratella, Stefano. - In: JOURNAL OF APPLIED NON-CLASSICAL LOGICS. - ISSN 1958-5780. - STAMPA. - 28:4(2018), pp. 297-312. [10.1080/11663081.2018.1468677]
Continuous propositional modal logic
Stefano Baratella
2018-01-01
Abstract
We introduce a propositional many-valued modal logic which is an extension of the Continuous Propositional Logic to a modal system. Otherwise said, we extend the minimal modal logic K to a Continuous Logic system. After introducing semantics, axioms and deduction rules, we establish some preliminary results. Then we prove the equivalence between consistency and satisfiability. As straightforward consequences, we get compactness, an approximated completeness theorem, in the vein of Continuous Logic, and a Pavelka-style completeness theorem.File | Dimensione | Formato | |
---|---|---|---|
baratella_propCML_R3.pdf
Solo gestori archivio
Descrizione: Articolo
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
305.84 kB
Formato
Adobe PDF
|
305.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione