English
Related papers

Related papers: Frame definability in finitely-valued modal logics

200 papers

Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such that the classes of frames they determine give rise to an…

Logic in Computer Science · Computer Science 2025-08-15 Philippe Balbiani , Tinko Tinchev

We study two notions of definability for classes of relational structures based on modal extensions of {\L}ukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these…

Logic · Mathematics 2015-11-26 Bruno Teheux

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.

Logic · Mathematics 2016-05-31 Reihane Zoghifard , Massoud Pourmahdian

In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal…

Logic · Mathematics 2022-04-18 Amanda Vidal

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…

Logic in Computer Science · Computer Science 2023-06-22 Denisa Diaconescu , George Metcalfe , Laura Schnüriger

In this paper, we present a first-order frame condition for interpretability logic and show that the condition is not modally definable. Yet, the frame-condition holds both on ILM and on ILP frames and, hence, is of potential importance for…

In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…

Logic in Computer Science · Computer Science 2022-06-16 Chun-Yu Lin , Churn-Jung Liau

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…

Logic · Mathematics 2026-04-14 Jim de Groot , Ian Shillito , Ranald Clouston

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…

Logic in Computer Science · Computer Science 2023-06-22 Miika Hannula

We study which classic modal definability and preservation results survive when attention is restricted to finite structures, where many first-order transfer theorems are known to break down. Several semantic characterizations for modal…

Logic in Computer Science · Computer Science 2026-03-13 Johan van Benthem , Balder ten Cate , Xi Yang

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

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn
‹ Prev 1 2 3 10 Next ›