English
Related papers

Related papers: Paraconsistent Constructive Modal Logic

200 papers

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

Logic · Mathematics 2023-11-07 Grigory K. Olkhovikov

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…

Logic · Mathematics 2022-10-19 Tiziano Dalmonte

We study a variant of the modal $\mu$-calculus based on the constructive modal logic $\mathsf{CK}$. We define game semantics for the constructive $\mu$-calculus and prove its equivalence to the birelational Kripke semantics. We then use the…

Logic in Computer Science · Computer Science 2026-04-28 Leonardo Pacheco

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

We introduce a~paraconsistent modal logic $\mathbf{K}\mathsf{G}^2$, based on G\"{o}del logic with coimplication (bi-G\"{o}del logic) expanded with a De Morgan negation $\neg$. We use the logic to formalise reasoning with graded, incomplete…

Logic · Mathematics 2022-08-16 Marta Bílková , Sabine Frittella , Daniil Kozhemiachenko

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

We further develop the paraconsistent G\"{o}del modal logic. In this paper, we consider its version endowed with Kripke semantics on $[0,1]$-valued frames with two fuzzy relations $R^+$ and $R^-$ (degrees of trust in assertions and denials)…

Logic · Mathematics 2023-03-27 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

Logic in Computer Science · Computer Science 2021-04-19 Pablo Barenbaum , Teodoro Freund

This paper belongs to the field of probabilistic modal logic, focusing on a comparative analysis of two distinct semantics: one rooted in Kripke semantics and the other in neighbourhood semantics. The primary distinction lies in the…

Logic · Mathematics 2024-04-25 Nino Guallart

We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the…

Logic in Computer Science · Computer Science 2017-01-11 Lutz Strassburger , Anupam Das , Ryuta Arisaka

We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…

Logic · Mathematics 2026-04-14 Jim de Groot , Ian Shillito , Ranald Clouston

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…

Logic · Mathematics 2025-12-01 Marta Bílková , Thomas M. Ferguson , Daniil Kozhemiachenko

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

Logic in Computer Science · Computer Science 2007-05-23 Jørgen Villadsen

We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…

Logic in Computer Science · Computer Science 2023-09-13 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti
‹ Prev 1 2 3 10 Next ›