We present a sequent calculus and a proof-search procedure for the Kuznetsov–Muravitsky Logic KM, an in- tuitionistic modal logic extending the Intuitionistic Strong Löb Logic with the Cantor–Bendixson axiom. The proof-search procedure is based on a sequent calculus that ensures strong termination and supports countermodel extraction. To support practical experimentation, we provide an implementation of both the proof-search and countermodel-extraction procedures.
A proof-search procedure for Kuznetsov-Muravitski Logic / M. Ferrari, C.F. (CEUR WORKSHOP PROCEEDINGS). - In: CILC 2026 : Italian Conference on Computational Logic 2026 / [a cura di] D. Azzolini, A. Bertagnon, M. Gavanelli, F. Riguzzi, M. Vespa. - [s.l] : CEUR Workshop Proceedings, 2026 Aug. - pp. 1-15 (( 41. Italian Conference on Computational Logic Ferrara 2026.
A proof-search procedure for Kuznetsov-Muravitski Logic
M. Ferrari;C. Fiorentini;
2026
Abstract
We present a sequent calculus and a proof-search procedure for the Kuznetsov–Muravitsky Logic KM, an in- tuitionistic modal logic extending the Intuitionistic Strong Löb Logic with the Cantor–Bendixson axiom. The proof-search procedure is based on a sequent calculus that ensures strong termination and supports countermodel extraction. To support practical experimentation, we provide an implementation of both the proof-search and countermodel-extraction procedures.
| File | Dimensione | Formato | |
|---|---|---|---|
|
cilc2026.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Licenza:
Creative commons
Dimensione
1.39 MB
Formato
Adobe PDF
|
1.39 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
