English
Related papers

Related papers: Swap Kripke models for deontic LFIs

200 papers

The aim of this paper is to combine several Ivlev-like modal systems characterized by 4-valued non-deterministic matrices (Nmatrices) with IDM4, a 4-valued expansion of Belnap-Dunn's logic FDE with an implication introduced by Pynko in…

Logic in Computer Science · Computer Science 2024-04-19 Marcelo E. Coniglio

In this paper the 3-valued paraconsistent first-order logic QCiore is studied from the point of view of Model Theory. The semantics for QCiore is given by partial structures, which are first-order structures in which each n-ary predicate R…

Logic · Mathematics 2018-08-24 Marcelo E. Coniglio , Tadeo G. Gomez , Martin Figallo

We further develop the formal foundations of Paraconsistent Belief Revision (PBR) by introducing Logics of Formal Inconsistency (LFIs) specifically designed to support the development of epistemic entrenchment-based models for belief…

Logic in Computer Science · Computer Science 2026-02-24 Marcelo E. Coniglio , Martin Figallo , Rafael R. Testa

Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…

Logic · Mathematics 2019-07-02 Parvin Safari , Saeed Salehi

The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…

Artificial Intelligence · Computer Science 2022-09-27 Francesco Olivieri , Guido Governatori , Matteo Cristani , Antonino Rotolo , Abdul Sattar

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

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by…

Artificial Intelligence · Computer Science 2025-04-25 Lucas Carr , Nicholas Leisegang , Thomas Meyer , Sergei Obiedkov

In this article we construct the first examples of strongly aperiodic linearly repetitive Delone sets in non-abelian Lie groups by means of symbolic substitutions. In particular, we find such sets in all $2$-step nilpotent Lie groups with…

Dynamical Systems · Mathematics 2025-12-17 Siegfried Beckus , Tobias Hartnick , Felix Pogorzelski

We revisit the duality between Kripke and algebraic semantics of intuitionistic and intuitionistic modal logic. We find that there is a certain mismatch between the two semantics, which means that not all algebraic models can be embedded…

Logic in Computer Science · Computer Science 2024-12-18 G. A. Kavvos

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

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

This work is divided between two main areas: in the theory of multialgebras, we focus mostly on a new definition of what a freely generated object should be in their category, and on how this category is equivalent to another with partially…

Logic · Mathematics 2022-06-23 Guilherme Vicentin de Toledo

We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and…

Programming Languages · Computer Science 2023-04-13 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

In this paper, we prove the semantic incompleteness of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that was proposed in Liberman et al. (2020) "Dynamic Term-modal Logics for First-order…

Logic in Computer Science · Computer Science 2025-01-03 Takahiro Sawasaki

The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in the papers [15] and [16]. In this paper, we introduce and study the class of modal pseudocomplemented De Morgan algebras enriched by an…

In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke's possible world semantics. This kind of modal systems characterized by…

Logic · Mathematics 2021-01-08 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

In our previous research, we provided a reasoning system (called LeSAC) based on argumentation theory to provide legal support to designers during the design process. Building on this, this paper explores how to provide designers with…

Artificial Intelligence · Computer Science 2024-09-19 Zhe Yu , Yiwei Lu

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

The updated version of this paper has already been published in The Australasian Journal of Logic. You can access to the paper from the following link: https://ojs.victoria.ac.nz/ajl/article/view/7696. This paper shows Hilbert system…

Logic in Computer Science · Computer Science 2023-12-27 Masanobu Toyooka , Katsuhiko Sano

We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…

Logic · Mathematics 2025-08-13 Ryo Kashima , Taishi Kurahashi , Sohei Iwata , So Morioka