English
Related papers

Related papers: Coherence in Modal Logic

200 papers

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

In previous articles, we showed that the category of profinite $L$-algebras (where $L$ is a normal modal logic with the finite model property) is monadic over $\textbf{Set}$. Then, we developed sequent calculi for extensions of the language…

Logic · Mathematics 2025-09-17 Matteo De Berardinis

A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. Examples of finitely universal varieties of semigroups have been available since the early 1970s, but it is unknown if there…

Group Theory · Mathematics 2020-08-14 Sergey V. Gusev , Edmond W. H. Lee

Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…

Logic · Mathematics 2025-04-23 Monika Drzewiecka , Aleksander Ivanov , Bartosz Mokry

Coherent superpositions are one of the hallmarks of quantum mechanics and are vital for any quantum mechanical device to outperform the classically achievable. Generically, superpositions are verified in interference experiments, but…

Quantum Physics · Physics 2020-03-04 Benjamin Dive , Nikolaos Koukoulekidis , Stefanos Mousafeiris , Florian Mintert

A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…

Logic · Mathematics 2021-07-13 T. Moraschini

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

We investigate various homotopy invariant formulations of commutative algebra in the context of rational homotopy theory. The main subject is the complete intersection condition, where we show that a growth condition implies a structure…

Algebraic Topology · Mathematics 2010-06-11 J. P. C. Greenlees , K. Hess , S. Shamir

A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…

Category Theory · Mathematics 2023-04-03 Jiří Adámek , Jiří Rosický

This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…

Representation Theory · Mathematics 2007-05-23 Alice Fialowski , Michael Penkava

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

Logic in Computer Science · Computer Science 2011-05-05 Edith Hemaspaandra , Henning Schnoor

A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard…

Group Theory · Mathematics 2020-09-15 Yang Dandan , Victoria Gould , Miklos Hartmann , Nik Ruskuc , Rida-E Zenab

We show that the symmetric portion of correlated coherence is always a valid quantifier of entanglement, and that this property is independent of the particular choice of coherence measure. This leads to an infinitely large class of…

Quantum Physics · Physics 2018-12-05 Kok Chuan Tan , Hyunseok Jeong

Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…

Logic · Mathematics 2024-01-09 Lavinia Corina Ciungu

The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…

Artificial Intelligence · Computer Science 2012-03-19 Erik Quaeghebeur

A criterion for a functor between derived categories of coherent sheaves to be full and faithful is given. A semiorthogonal decomposition for the derived category of coherent sheaves on the intersection of two even dimensional quadrics is…

alg-geom · Mathematics 2008-02-03 A. Bondal , D. Orlov

An important aspect in the theory of algebras with polynomial identities is the study of the asymptotic behavior of the codimension sequence $c_n(A),\, n\geq 1,$ which measures the growth of polynomial identities of a given algebra $A$. In…

Rings and Algebras · Mathematics 2025-12-05 Wesley Quaresma Cota , Felipe Yasumura