A simple loopcheck for intuitionistic K

DOI10.1007/978-3-031-62687-6_4MaRDI QIDQ7034654zbMATH OpenFDO

Authors Marianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales, Lutz Straßburger

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-62687-6_4

zbMATH Keywords

decidabilityfinite model propertyintuitionistic modal logiclabelled sequent calculusroot-first proof search

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45)

Cites work

• A fully labelled proof system for intuitionistic modal logics
• Constructive modal logics. I
• scientific article; zbMATH DE number 3950488 (Why is no real title available?)
• scientific article; zbMATH DE number 3706414 (Why is no real title available?)
• Intuitionistic S4 is decidable
• Maehara-style modal nested calculi
• MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
• Proofs and countermodels in non-classical logics
• The Church-Fitch knowability paradox in the light of structural proof theory

Cited in

(1)

• Intuitionistic modal logics: tips and clips

This page was built for publication: A simple loopcheck for intuitionistic K

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034654)