Results 11 to 20 of about 87,429 (211)
A Resolution Prover for Coalition Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency.
Cláudia Nalon +3 more
doaj +5 more sources
Theorem Provers For Every Normal Modal Logic
EPiC Series in Computing, 2018 We present a procedure for algorithmically embedding problems formulated in higher- order modal logic into classical higher-order logic. The procedure was implemented as a stand-alone tool and can be used as a preprocessor for turning TPTP THF-compliant the- orem provers into provers for various modal logics.
Tobias Gleißner +2 more
openalex +4 more sources
Quantification in Some Non-normal Modal Logics [PDF]
Journal of Philosophical Logic, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erica Calardo, Antonino Rotolo
openalex +5 more sources
Rosser provability and normal modal logics [PDF]
Studia Logica, 2018 In this paper, we investigate Rosser provability predicates whose provability logics are normal modal logics. First, we prove that there exists a Rosser provability predicate whose provability logic is exactly the normal modal logic ${\sf KD}$. Secondly, we introduce a new normal modal logic ${\sf KDR}$ which is a proper extension of ${\sf KD}$, and ...
Taishi Kurahashi
openalex +4 more sources
Certification of Prefixed Tableau Proofs for Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented.
Tomer Libal, Marco Volpe
doaj +8 more sources
Normal Modal Logics Determined by Aligned Clusters [PDF]
Studia Logica, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zofia Kostrzycka, Yutaka Miyazaki
openalex +3 more sources
Ł-Axiomatizability in intermediate and normal modal logics [PDF]
, 2014 A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is -complete relative to a given class of logics, if every logic of this class can be -axiomatized by formulas from $F$, that is, every of these logics can be defined by an ...
Alex Citkin
openalex +3 more sources
Intuitionistic Non-normal Modal Logics: A General Framework [PDF]
Journal of Philosophical Logic, 2020 Preprint
Tiziano Dalmonte +2 more
openalex +5 more sources
Calculi for Intuitionistic Normal Modal Logic [PDF]
, 2016 This paper provides a call-by-name and a call-by-value term calculus, both of which have a Curry-Howard correspondence to the box fragment of the intuitionistic modal logic IK. The strong normalizability and the confluency of the calculi are shown. Moreover, we define a CPS transformation from the call-by-value calculus to the call-by-name calculus ...
Yoshihiko Kakutani
openalex +3 more sources
Normal forms in modal logic. [PDF]
Notre Dame Journal of Formal Logic, 1975 Kit Fine
openalex +3 more sources