English
Related papers

Related papers: Sahlqvist theory for impossible worlds

200 papers

Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…

Logic · Mathematics 2024-05-07 Vitor Greati , Sérgio Marcelino , Umberto Rivieccio

The unified correspondence theory for distributive lattice expansion logics (DLE-logics) is specialized to strict implication logics. As a consequence of a general semantic consevativity result, a wide range of strict implication logics can…

Logic · Mathematics 2016-05-27 Minghui Ma , Zhiguang Zhao

Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…

Logic · Mathematics 2012-10-30 Lev Beklemishev , David Gabelaia

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…

Logic in Computer Science · Computer Science 2017-01-11 Pascal Tesson , Denis Therien

Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer…

Logic in Computer Science · Computer Science 2026-01-21 Stanislav Kikot , Agi Kurucz , Yoshihito Tanaka , Frank Wolter , Michael Zakharyaschev

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker

We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation's characterization of a hierarchy of pseudovarieties of finite lattices,…

Logic · Mathematics 2014-08-11 Sabine Frittella , Alessandra Palmigiano , Luigi Santocanale

We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…

Quantum Physics · Physics 2016-09-19 Mladen Pavicic

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…

Artificial Intelligence · Computer Science 2013-12-24 Pedro Cabalar , Jorge Fandinno

In this paper we consider the modal logic with both Box and Diamond arising fromKripke models with a crisp accessibility and whose propositions are valued over the stan-dard Godel algebra [0,1]G. We provide an axiomatic system extending the…

Logic · Mathematics 2020-05-01 Ricardo Oscar Rodriguez , Amanda Vidal Wandelmer

This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…

Logic in Computer Science · Computer Science 2008-12-16 Luigi Santocanale , Yde Venema

We describe a family of decidable propositional dynamic logics, where atomic modalities satisfy some extra conditions (for example, given by axioms of the logics K5, S5, or K45 for different atomic modalities). It follows from recent…

Logic · Mathematics 2023-05-30 Daniel Rogozin , Ilya Shapirovsky

General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…

Quantum Physics · Physics 2021-11-23 Lars M. Johansen

We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…

Logic · Mathematics 2026-05-15 Amanda Vidal

We investigate preservation results for the independent fusion of one-variable first-order modal logics. We show that, without equality, Kripke completeness and decidability of the global and local consequence relation are preserved, under…

Logic in Computer Science · Computer Science 2026-03-09 Roman Kontchakov , Dmitry Shkatov , Frank Wolter

We introduce syntactic modal operator $\BOX$ for \textit{being a thesis} into first-order logic. This logic is a modern realization of R. Carnap's old ideas on modality, as logical necessity (J. Symb. Logic, 1946) \cite{Ca46}. We place it…

Logic · Mathematics 2024-06-26 Marcin Łyczak

Intuitionistic modal logics (IMLs) extend intuitionistic propositional logic with modalities such as the box and diamond connectives. Advances in the study of IMLs have inspired several applications in programming languages via the…

Logic in Computer Science · Computer Science 2025-12-12 Nachiappan Valliappan

We construct a generalised notion of Kac-Moody algebras using smooth maps from the non-compact manifolds ${\cal M}=$SL$(2,\mathbb R)$ and ${\cal M}=$ SL$(2,\mathbb R)/U(1)$ to a finite-dimensional simple Lie group $G$. This construction is…

Mathematical Physics · Physics 2024-09-11 Rutwig Campoamor-Stursberg , Alessio Marrani , Michel Rausch de Traubenberg

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

Logic · Mathematics 2023-06-05 Colin Bloomfield , Yoshihiro Maruyama