English
Related papers

Related papers: Reflexive insensitive modal logics

200 papers

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

Logic · Mathematics 2014-08-26 Wojciech Dzik , Michal M. Stronkowski

We give a criterion for rings with $\m^3=0$ which are obtained as connected sums of two other rings to have non-trivial totally acyclic modules.

Commutative Algebra · Mathematics 2019-05-07 Adela Vraciu

We investigate the modal logic of stepwise removal of objects, both for its intrinsic interest as a logic of quantification without replacement, and as a pilot study to better understand the complexity jumps between dynamic epistemic logics…

Logic in Computer Science · Computer Science 2021-03-10 Johan van Benthem , Krzysztof Mierzewski , Francesca Zaffora Blando

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

Logic in Computer Science · Computer Science 2026-03-17 Jan Laštovička

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…

Logic in Computer Science · Computer Science 2014-11-27 Richard Prideaux Evans , Martin Berger

Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…

Logic in Computer Science · Computer Science 2023-10-03 Marco Bernardo , Andrea Esposito

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

Logic · Mathematics 2025-06-23 Søren Brinck Knudstorp

We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. The latter means that programs do not contain "marks" showing…

Logic in Computer Science · Computer Science 2023-06-22 Paula Severi

In the literature, the question about how to axiomatize the transitive logic of false belief is thought of as hard and left as an open problem. In this paper, among other contributions, we deal with this problem. In more details, although…

Logic · Mathematics 2024-04-12 Jie Fan

Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…

Logic · Mathematics 2026-03-17 Yuki Nishimura

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

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

Logic · Mathematics 2021-09-07 Nicholas Pischke

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

Logic in Computer Science · Computer Science 2018-09-11 Jakub Michaliszyn

We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the…

Logic · Mathematics 2020-11-05 Stanislav Kikot , Ilya Shapirovsky , Evgeny Zolin

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

In 1988, Ivlev proposed four-valued non-deterministic semantics for modal logics in which the alethic T axiom holds good. Unfortunately, no completeness was proved. In previous work, we proved completeness for some Ivlev systems and…

Logic · Mathematics 2018-08-31 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

We examine the modular properties of nonrenormalizable superpotential terms in string theory and show that the requirement of modular invariance necessitates the nonvanishing of certain Nth order nonrenormalizable terms. In a class of…

High Energy Physics - Theory · Physics 2009-10-22 S. Kalara , J. Lopez , D. Nanopoulos

We propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…

Logic in Computer Science · Computer Science 2019-04-25 Yosuke Fukuda , Akira Yoshimizu

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Logic in Computer Science · Computer Science 2025-04-07 Silvio Ghilardi , Jérémie Marquès
‹ Prev 1 8 9 10 Next ›