English
Related papers

Related papers: Bi-modal G\"odel logic over [0,1]-valued Kripke fr…

200 papers

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

Logic in Computer Science · Computer Science 2015-08-17 Christopher Hampson , Agi Kurucz

We study the modal completeness and the finite frame property of several sublogics of the logic $\mathbf{IL}$ of interpretability with respect to Visser frames, which are also called simplified Veltman frames. Among other things, we prove…

Logic · Mathematics 2024-05-22 Yuya Okawa , Taishi Kurahashi

We consider quantified pretransitive Horn modal logic. It is known that such logics are complete with respect to predicate Kripke frames with expanding domains. In this paper we prove that they are also complete with respect to…

Logic · Mathematics 2021-11-01 Andrey Kudinov

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…

Logic · Mathematics 2022-12-14 Merlin Carl , Lorenzo Galeotti , Robert Passmann

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

We study the first-order primal infon logic. It is the core of the policy language DKAL. We provide Gentzen-style calculi for two versions of this logic that are not equivalent. For both versions we investigate the semantics: one of them is…

Logic · Mathematics 2015-02-20 Alexandra Podgaits

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

Artificial Intelligence · Computer Science 2015-09-30 Stefan Borgwardt , Rafael Peñaloza

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

Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Thomason \cite{Thomason74} showed that a certain modal logic $\mathbf{L}\subset \mathbf{S4}$ is incomplete with respect to Kripke semantics. Later Gerson \cite{Gerson75} showed that $\mathbf{L}$ is also incomplete with respect to…

Logic · Mathematics 2012-02-16 Jacob Vosmaer

We generalize methods, developed by S. Ghilardi, and apply them to a subsystem J$_2$ of bimodal provability logic GLB. We describe projective formulas in J$_2$ in terms of Kripke semantics and prove that logic J$_2$ has finitary unification…

Logic · Mathematics 2024-03-27 N. V. Lukashov

Abashidze and Blass independently proved that the modal logic $\sf{GL}$ is complete for its topological interpretation over any ordinal greater than or equal to $\omega^\omega$ equipped with the interval topology. Icard later introduced a…

Logic · Mathematics 2015-11-19 Juan P. Aguilera , David Fernández-Duque

We study an intuitionistic version of common knowledge logic (CK), called ICK, which was introduced by J\"ager and Marti. ICK extends intuitionistic propositional logic (IPL) by multiple box modalities interpreted as knowledge operators for…

Logic · Mathematics 2026-05-04 Lukas Zenger

We represent a bilinear Calder\'on-Zygmund operator at a given smoothness level as a finite sum of cancellative, complexity zero operators, involving smooth wavelet forms, and continuous paraproduct forms. This representation results in a…

Classical Analysis and ODEs · Mathematics 2023-04-26 Francesco Di Plinio , A. Walton Green , Brett D. Wick

In 1933, G\"odel considered two modal approaches to describing provability. One captured formal provability and resulted in the logic GL and Solovay's Completeness Theorem. The other was based on the modal logic S4 and led to Artemov's…

Logic · Mathematics 2014-05-13 Elena Nogina

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

Fuzzy Epistemic Logic is an important formalism for approximate reasoning. It extends the well known basic propositional logic BL, introduced by H\'ajek, by offering the ability to reason about possibility and necessity of fuzzy…

Logic · Mathematics 2018-05-01 Manuela Busaniche , Penélope Cordero , Ricardo O. Rodríguez

Ono's modal FL-algebras are models of an extension of Full Lambek logic that has the modalities ! and ? of linear logic. Here we define a notion of modal FL-cover system that combines aspects of Beth-Kripke-Joyal semantics with Girard's…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson
‹ Prev 1 4 5 6 7 8 10 Next ›