English
Related papers

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

200 papers

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…

Artificial Intelligence · Computer Science 2022-03-29 Jorge Fandinno , Luis Fariñas del Cerro

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

Logic · Mathematics 2026-02-25 Alfredo Roque Freire , Manuel António Martins

In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…

Logic in Computer Science · Computer Science 2015-10-20 Steffen Lewitzka

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

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

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

The method K\"urbis used to formalise definite descriptions with a binary quantifier I, such that I$x[F,G]$ indicates `the F is G', is examined and improved upon in this work. K\"urbis first looked at I in intuitionistic logic and its…

Logic in Computer Science · Computer Science 2025-01-03 Yaroslav Petrukhin

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…

Logic · Mathematics 2020-02-27 Nick Bezhanishvili , Almudena Colacito , Dick de Jongh

BS4 is a natural Belnapian conservative extension of Lewis modal system S4 via strong negation. In [24] it was proved that the translation TB that naturally generalises the Godel-Tarski translation T embeds faithfully Nelsons logic N4 into…

Logic · Mathematics 2025-11-26 Dmitry M. Anishchenko

The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which…

Logic in Computer Science · Computer Science 2014-12-09 Steffen Lewitzka

Logic programming has developed as a rich field, built over a logical substratum whose main constituent is a nonclassical form of negation, sometimes coexisting with classical negation. The field has seen the advent of a number of…

Logic in Computer Science · Computer Science 2011-05-09 Éric A. Martin

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

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

In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…

Logic · Mathematics 2025-03-27 James Walsh

Besides the better-known Nelson logic (N3) and paraconsistent logic (N4), in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called S. The logic S was originally presented by means of a calculus…

Logic · Mathematics 2019-09-24 Thiago Nascimento , Umberto Rivieccio , Joao Marcos , Matthew Spinks

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

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

Intuitionistic conditional logic, studied by Weiss, Ciardelli and Liu, and Olkhovikov, aims at providing a constructive analysis of conditional reasoning. In this framework, the would and the might conditional operators are no longer…

Logic in Computer Science · Computer Science 2025-07-04 Tiziano Dalmonte , Marianna Girlando

We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we…

Artificial Intelligence · Computer Science 2022-02-16 Giovanni Casini , Umberto Straccia