English
Related papers

Related papers: Fusions of One-Variable First-Order Modal Logics

200 papers

In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…

Logic in Computer Science · Computer Science 2015-12-29 Christopher Hampson , Stanislav Kikot , Agi Kurucz

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

Logic in Computer Science · Computer Science 2015-07-01 Luc Segoufin , Balder ten Cate

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

In this paper, we study logics of bounded distributive residuated lattices with modal operators considering $\Box$ and $\Diamond$ in a noncommutative setting. We introduce relational semantics for such substructural modal logics. We prove…

Logic · Mathematics 2020-06-02 Daniel Rogozin

We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…

Logic in Computer Science · Computer Science 2026-02-03 Przemysław Andrzej Wałęga , Bernardo Cuenca Grau

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

This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant and varying domains. The addition of counting quantifiers…

Logic in Computer Science · Computer Science 2018-12-18 Christopher Hampson

We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Logic in Computer Science · Computer Science 2020-12-23 Igor Sedlár

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

In modal logic, semantic consequence is usually defined locally by truth preservation at all worlds in all models (with respect to a class of frames). It can also be defined globally by truth preservation in all models (with respect to a…

Logic in Computer Science · Computer Science 2019-10-08 Xuefeng Wen

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

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

Uniform one-dimensional fragment UF1^= is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified…

Logic · Mathematics 2014-09-03 Emanuel Kieroński , Antti Kuusisto

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…

Logic · Mathematics 2013-07-16 Lev Beklemishev

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 Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the…

Logic in Computer Science · Computer Science 2022-02-14 Noah Abou El Wafa , André Platzer

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

We call a first-order formula one-dimensional if its every maximal block of existential (universal) quantifiers leaves at most one variable free. We consider the one-dimensional restrictions of the guarded fragment, GF, and the tri-guarded…

Logic in Computer Science · Computer Science 2019-07-01 Emanuel Kieronski