English
Related papers

Related papers: Cover Systems for the Modalities of Linear Logic

200 papers

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…

Quantum Physics · Physics 2014-12-31 Daniel Marsden

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

Logic · Mathematics 2023-03-07 Mariana Floricica Calin , Cristina Flaut , Dana Piciu

The two Girard translations provide two different means of obtaining embeddings of Intuitionistic Logic into Linear Logic, corresponding to different lambda-calculus calling mechanisms. The translations, mapping A -> B respectively to !A -o…

Logic in Computer Science · Computer Science 2025-01-29 Pablo Barenbaum , Eduardo Bonelli

The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which…

Logic in Computer Science · Computer Science 2014-12-09 Steffen Lewitzka

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…

Logic in Computer Science · Computer Science 2021-08-20 Jonne Iso-Tuisku , Antti Kuusisto

Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…

Logic in Computer Science · Computer Science 2024-11-26 Sebastian Siebertz , Alexandre Vigny

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

K-Theory and Homology · Mathematics 2009-09-03 Ivo Herzog

We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

We overview the logic of Bunched Implications (BI) and Separation Logic (SL) from a perspective inspired by Hiroakira Ono's algebraic approach to substructural logics. We propose generalized BI algebras (GBI-algebras) as a common framework…

Logic in Computer Science · Computer Science 2018-09-27 Peter Jipsen , Tadeusz Litak

In this paper, we study a new Kripke-style semantics for classical modal logic, named as provability models. We study provability models for the propositional modal logics K, K4, S4 GL, GLP and the interpretability logic ILM. Provability…

Logic · Mathematics 2025-11-20 Mojtaba Mojtahedi , Borja Sierra Miranda

The system of intuitionistic modal logic ${\bf IEL}^{-}$ was proposed by S. Artemov and T. Protopopescu as the intuitionistic version of belief logic \cite{Artemov}. We construct the modal lambda calculus which is Curry-Howard isomorphic to…

Logic · Mathematics 2020-12-08 Daniel Rogozin

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…

Logic · Mathematics 2026-03-24 Giuliano Rosella , Sara Ugolini

We propose a new modal logic endowed with a simple deductive system to interpret Aristotle's theory of the modal syllogism. While being inspired by standard propositional modal logic it is also a logic of terms that admits a (sound)…

Logic · Mathematics 2022-06-15 Clarence Protin

We first establish several general properties of modality of algebraic group actions. In particular, we introduce the notion of a modality-regular action and prove that every visible action is modality-regular. Then, using these results, we…

Representation Theory · Mathematics 2017-07-26 Vladimir L. Popov

The paper extends existing Lie algebra representation theory related to Lie algebra gradings. The notion of a representation compatible with a given grading is defined and applied to finite-dimensional representations of $sl(n,\mathbb{C})$…

Mathematical Physics · Physics 2010-11-16 Miloslav Havlíček , Edita Pelantová , Jiří Tolar

The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear…

Programming Languages · Computer Science 2007-05-23 M. Bozzano , G. Delzanno , M. Martelli

We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability…

Logic in Computer Science · Computer Science 2026-05-20 Carlos Areces , Pablo Barceló , Valentin Cassano , Pablo F. Castro , Stéphane Demri , Raul Fervari
‹ Prev 1 3 4 5 6 7 10 Next ›