English
Related papers

Related papers: A basic system of paraconsistent Nelsonian logic o…

200 papers

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

We introduce an intuitionistic modal logic strictly contained in the intuitionistic modal logic IK and being an appropriate candidate for the title of ``minimal normal intuitionistic modal logic''.

Logic · Mathematics 2025-02-27 Philippe Balbiani , Çigdem Gencer

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

Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…

Logic in Computer Science · Computer Science 2021-10-07 Yanhong A. Liu , Scott D. Stoller

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

Besides the better-known Nelson's Logic and Paraconsistent Nelson's Logic, in "Negation and separation of concepts in constructive systems" (1959), David Nelson introduced a logic called S with the aim of analyzing the constructive content…

Logic · Mathematics 2018-06-12 Thiago Nascimento , Umberto Rivieccio , João Marcos , Matthew Spinks

We prove that the provability logic of all provability predicates is exactly Fitting, Marek, and Truszczy\'nski's pure logic of necessitation $\mathsf{N}$. Moreover, we introduce three extensions $\mathsf{N4}$, $\mathsf{NR}$, and…

Logic · Mathematics 2023-09-04 Taishi Kurahashi

It is known that intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth functions. We extend this generalized Kripke semantics to first-order logic, and study how…

Logic · Mathematics 2022-05-13 Naosuke Matsuda , Kento Takagi

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

The paper treats 4 different fragments of first-order logic induced by their respective versions of Kripke style semantics for modal intuitionistic logic. In order to capture these fragments, the notion of asimulation is modified and…

Logic · Mathematics 2018-02-01 Grigory Olkhovikov

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

Inspired by Hintikka's treatment of question embedding verbs in [8] and the variations of noncontingency operator, we propose a logic with strong noncontingency operator $\blacktriangle$ as the only primitive modality. A proposition is…

Logic in Computer Science · Computer Science 2019-09-18 Jie Fan

We discuss the problem of defining a logic for analogical reasoning, and sketch a solution in the style of the semantics for Counterfactual Conditionals, Preferential Structures, etc.

Logic in Computer Science · Computer Science 2019-10-08 Karl Schlechta

The aim of this paper is to introduce the logics FFDE and FN4, which are universally free versions of Belnap-Dunn's four-valued logic, also known as the logic of first-degree entailment (FDE), and Nelson's paraconsistent logic QN4 (N-).…

Logic · Mathematics 2024-12-30 Henrique Antunes , Abilio Rodrigues

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

We develop a proof-theoretic semantics -- in particular, a base-extension semantics -- for multi-agent S5 modal logic (and hence also for the usual unindexed S5). Following the inferentialist interpretation of logic, this gives us a…

Logic · Mathematics 2024-06-10 Timo Eckhardt , David Pym

We introduce a new propositional logic, called very weak subintuitionistic logic $\mathbf{VF}$, by adapting the relational semantics of Fitting, Marek, and Truszczy\'nski for the pure logic of necessitation $\mathbf{N}$ to the propositional…

Logic · Mathematics 2026-05-21 Taishi Kurahashi , Mashu Noguchi

In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded…

Artificial Intelligence · Computer Science 2007-05-23 Pascal Hitzler

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

We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and several their non-infectious modifications, including two new logics, reformulate previously constructed natural deduction systems for them (or present such systems from…

Logic in Computer Science · Computer Science 2022-04-15 Yaroslav Petrukhin