English
Related papers

Related papers: Sahlqvist theory for impossible worlds

200 papers

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and…

The aim of the present paper is to generalise Sahlqvist correspondence theory to the many-valued modal semantics defined by Fitting, assuming a perfect Heyting algebra as truth value space. We present the standard translations between…

Logic · Mathematics 2025-06-12 Cecelia Britz , Willem Conradie , Wilmari Morton

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…

Logic · Mathematics 2023-11-17 Adam Přenosil

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

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

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE algebras). We work in the purely algebraic setting of…

Logic · Mathematics 2024-05-03 Alessandra Palmigiano , Mattia Panettiere

In the present paper, we develop the algorithmic correspondence theory for hybrid logic with binder. We define the class of Sahlqvist inequalities, each inequality of which is shown to have a first-order frame correspondent effectively…

Logic in Computer Science · Computer Science 2021-07-13 Zhiguang Zhao

We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in the standard…

Logic in Computer Science · Computer Science 2023-12-12 Doratossadat Dastgheib , Hadi Farahani

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

In this paper, we deal with the problem of putting together modal worlds that operate in different logic systems. When evaluating a modal sentence $\Box \varphi$, we argue that it is not sufficient to inspect the truth of $\varphi$ in…

Logic · Mathematics 2022-03-02 Alfredo Roque Freire , Manuel A. Martins

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

Logic in Computer Science · Computer Science 2024-04-24 Yevgeny Kazakov , Ian Pratt-Hartmann

Recent published work has addressed the Shalqvist correspondence problem for non-distributive logics. The natural question that arises is to identify the fragment of first-order logic that corresponds to logics without distribution, lifting…

Logic · Mathematics 2024-12-23 Chrysafis , Hartonas

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

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…

Logic · Mathematics 2023-11-08 Robert Goldblatt

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

We present a new uniform method for studying modal companions of superintuitionistic rule systems and related notions, based on the machinery of stable canonical rules. Using this method, we obtain alternative proofs of the Blok-Esakia…

Logic · Mathematics 2025-08-27 Nick Bezhanishvili , Antonio Maria Cleani

This paper proposes a connection method \`a la Bibel for an exception-tolerant family of description logics (DLs). As for the language, we assume the DL $\mathcal{ALCH}$ extended with two typicality operators: one on (complex) concepts and…

Logic in Computer Science · Computer Science 2023-06-23 Renan Fernandes , Fred Freitas , Ivan Varzinczak , Pedro PM Farias