English
Related papers

Related papers: On Sub-Propositional Fragments of Modal Logic

200 papers

Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the…

Artificial Intelligence · Computer Science 2025-11-18 Piotr Gorczyca , Hannes Strass

In this paper we present simple example of propositional logic which has one modal operator and is based on intuitionistic core. This system is very weak in modal sense - e.g. rules of regularity or monotonicity do not hold. It has complete…

Logic · Mathematics 2018-06-26 Tomasz Witczak

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…

Logic in Computer Science · Computer Science 2015-06-05 Liana Hadarean , Alex Horn , Tim King

We adapt our light Dialectica interpretation to usual and light modal formulas (with universal quantification on boolean and natural variables) and prove it sound for a non-standard modal arithmetic based on Goedel's T and classical S4. The…

Logic in Computer Science · Computer Science 2023-06-22 Dan Hernest , Trifon Trifonov

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the…

Logic in Computer Science · Computer Science 2012-10-26 Florent Madelaine , Barnaby Martin

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

Horn description logics are syntactically defined fragments of standard description logics that fall within the Horn fragment of first-order logic and for which ontology-mediated query answering is in PTime for data complexity. They were…

Logic in Computer Science · Computer Science 2019-04-16 Jean Christoph Jung , Fabio Papacchini , Frank Wolter , Michael Zakharyaschev

The branch of provability logic investigates the provability-based behavior of the mathematical theories. In a more precise way, it studies the relation between a mathematical theory $T$ and a modal logic $L$ via the provability…

Logic · Mathematics 2017-04-26 Amirhossein Akbar Tabatabai

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

Logic in Computer Science · Computer Science 2014-04-15 Fabio Mogavero , Giuseppe Perelli

Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments…

Logic in Computer Science · Computer Science 2012-10-10 Davide Bresolin , Dario Della Monica , Angelo Montanari , Pietro Sala , Guido Sciavicco

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We investigate this fragment over words and trees, presenting a…

Logic in Computer Science · Computer Science 2024-04-08 Emanuel Kieronski , Antti Kuusisto

The focus of this thesis is on (1) the role of Ka\v c-Moody (KM) algebras in string theory and the development of techniques for systematically building string theory models based on higher level ($K\geq 2$) KM algebras and (2) fractional…

High Energy Physics - Theory · Physics 2008-02-03 Gerald B. Cleaver

We investigate the complexity of satisfiability for finite-variable fragments of propositional dynamic logics. We consider three formalisms belonging to three representative complexity classes, broadly understood,---regular PDL, which is…

Logic in Computer Science · Computer Science 2019-09-16 Mikhail Rybakov , Dmitry Shkatov

We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of…

Logic · Mathematics 2014-01-15 Miika Hannula , Juha Kontinen

For all n > 0 there is a homomorphism from the smooth concordance group of knots in dimension 2n + 1 to an algebraically defined group called the rational algebraic concordance group. This algebraic concordance group splits as a direct sum…

Geometric Topology · Mathematics 2021-07-20 Charles Livingston

We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four…

Logic in Computer Science · Computer Science 2017-01-11 Angelo Montanari , Gabriele Puppis , Pietro Sala