English
Related papers

Related papers: Completeness for the coalgebraic cover modality

200 papers

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

We establish a number of results which say, roughly, that interpretation functors preserve algebraic complexity. First we show that representation embeddings between categories of modules of finite-dimensional algebras induce embeddings of…

Representation Theory · Mathematics 2017-05-17 Lorna Gregory , Mike Prest

We present a survey of the two-dimensional and tensorial structure of the lifting doctrine in constructive domain theory, i.e. in the theory of directed-complete partial orders (dcpos) over an arbitrary elementary topos. We establish the…

Category Theory · Mathematics 2025-01-31 Jonathan Sterling

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

Logic in Computer Science · Computer Science 2023-07-11 Xinghan Liu , Emiliano Lorini

We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product…

Logic · Mathematics 2017-09-08 Giuseppe Greco , Fei Liang , Alessandra Palmigiano , Umberto Rivieccio

This paper revisits soundness and completeness of proof systems for proving that sets of states in infinite-state labeled transition systems satisfy formulas in the modal mu-calculus. Our results rely on novel results in lattice theory,…

Logic in Computer Science · Computer Science 2023-10-04 Jeroen J. A. Keiren , Rance Cleaveland

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

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

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

We introduce a notion of formally \'etale $\mathbb{E}_{\infty}$-coalgebras and show that they admit essentially unique, functorial lifts along square zero extensions of $\mathbb{E}_{\infty}$-rings. Using this, we show that for a perfect…

Algebraic Topology · Mathematics 2024-05-16 Florian Riedel

We describe new structure on the Goodwillie derivatives of a functor, and we show how the full Taylor tower of the functor can be recovered from this structure. This new structure takes the form of a coalgebra over a certain comonad which…

Algebraic Topology · Mathematics 2014-11-10 Gregory Arone , Michael Ching

We extend logical categories with fiberwise interior and closure operators so as to obtain an embedding theorem into powers of the category of topological spaces. The required axioms, besides the Kuratowski closure axioms, are a `product…

Category Theory · Mathematics 2025-07-29 Silvio Ghilardi , Jérémie Marquès

Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…

Logic · Mathematics 2025-06-03 Borja Sierra Miranda , Thomas Studer , Lukas Zenger

Algebraic injectivity was introduced to capture homotopical structures like algebraic Kan complexes. But at a much simpler level, it allows one to describe sets with operations subject to no equations. If one wishes to add equations (or…

Category Theory · Mathematics 2022-01-31 John Bourke

A classical result of topos theory holds that the category of coalgebras for a Cartesian comonad on a topos is again a topos (Kock and Wraith, 1971). It is natural to refine this result to a topos-theoretic setting that includes universes.…

Category Theory · Mathematics 2024-05-02 Colin Zwanziger

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

Logic · Mathematics 2016-08-17 Eduardo Mizraji

In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…

Algebraic Topology · Mathematics 2024-05-01 Victor Roca i Lucio

It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…

Logic · Mathematics 2013-11-12 Guram Bezhanisevili , David Gabelaia , Joel Lucero-Bryan

This article is a survey on the cohomology of a reductive algebraic group with coefficients in twisted representations. A large part of the paper is devoted to the advances obtained by the theory of strict polynomial functors initiated by…

K-Theory and Homology · Mathematics 2018-10-04 Antoine Touzé

We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…

Logic in Computer Science · Computer Science 2016-03-04 Zoltan Esik
‹ Prev 1 4 5 6 7 8 10 Next ›