English
Related papers

Related papers: On Sub-Propositional Fragments of Modal Logic

200 papers

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

Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…

Logic in Computer Science · Computer Science 2021-03-16 Reijo Jaakkola

Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is…

Logic in Computer Science · Computer Science 2011-04-05 Peter Lohmann , Heribert Vollmer

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

Let G be a complex reductive group acting on a finite-dimensional complex vector space H. Let B be a Borel subgroup of G and let T be the associated torus. The Mumford cone is the polyhedral cone generated by the T-weights of the polynomial…

Representation Theory · Mathematics 2019-01-24 Velleda Baldoni , Michèle Vergne , Michael Walter

The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…

Logic · Mathematics 2025-02-18 Stepan L. Kuznetsov , Tikhon Pshenitsyn , Stanislav O. Speranski

In 1933, G\"odel introduced a provability interpretation of the propositional intuitionistic logic to establish a formalization for the BHK interpretation. He used the modal system, $\mathbf{S4}$, as a formalization of the intuitive concept…

Logic · Mathematics 2017-09-04 Amirhossein Akbar Tabatabai

We present the derivation reduction problem for SLD-resolution, the undecidable problem of finding a finite subset of a set of clauses from which the whole set can be derived using SLD-resolution. We study the reducibility of various…

Logic in Computer Science · Computer Science 2019-02-27 Sophie Tourret , Andrew Cropper

We introduce the semantically-defined constructive master-modality logics $\sf CK^*$ and $\sf WK^*$, extending the basic constructive modal logic $\sf CK$ and the Wijesekera-style logic $\sf WK$ obtained by impossing infallibility. Using…

Logic in Computer Science · Computer Science 2026-03-06 Sofía Santiago-Fernández , David Fernández-Duque , Joost J. Joosten

A $k$-antipower (for $k \ge 2$) is a concatenation of $k$ pairwise distinct words of the same length. The study of fragments of a word being antipowers was initiated by Fici et al. (ICALP 2016) and first algorithms for computing such…

Data Structures and Algorithms · Computer Science 2020-05-12 Tomasz Kociumaka , Jakub Radoszewski , Wojciech Rytter , Juliusz Straszyński , Tomasz Waleń , Wiktor Zuba

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

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the…

Logic · Mathematics 2023-07-12 Samuel Allen Alexander , Arthur Paul Pedersen

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

Prolog is a well known declarative programming language based on propositional Horn formulas. It is useful in various areas, including artificial intelligence, automated theorem proving, mathematical logic and so on. An active research area…

Logic in Computer Science · Computer Science 2021-03-02 Anish Mallick , Anil Shukla

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…

Logic in Computer Science · Computer Science 2013-12-11 Marta Cialdea Mayer

We consider propositional modal logic with two modal operators $\Box$ and $\D$. In topological semantics $\Box$ is interpreted as an interior operator and $\D$ as difference. We show that some important topological properties are…

Logic · Mathematics 2010-11-29 Kudinov Andrey

We give explicit, uniform formulas for the graded characters and total ranks of the Lie algebra homology of finite-dimensional representations in all classical types. In many cases, these compute the Tor groups of finite length modules over…

Representation Theory · Mathematics 2025-10-03 Steven V Sam , Keller VandeBogert , Jerzy Weyman

We argue that topological compactons (solitons with compact support) may be quite common objects if $k$-fields, i.e., fields with nonstandard kinetic term, are considered, by showing that even for models with well-behaved potentials the…

High Energy Physics - Theory · Physics 2009-04-17 C. Adam , J. Sanchez-Guillen , A. Wereszczynski

Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…

Quantum Physics · Physics 2013-05-10 Bob Coecke , Chris Heunen , Aleks Kissinger

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár
‹ Prev 1 8 9 10 Next ›