5,012 research outputs found
Relation lifting, with an application to the many-valued cover modality
We introduce basic notions and results about relation liftings on categories
enriched in a commutative quantale. We derive two necessary and sufficient
conditions for a 2-functor T to admit a functorial relation lifting: one is the
existence of a distributive law of T over the "powerset monad" on categories,
one is the preservation by T of "exactness" of certain squares. Both
characterisations are generalisations of the "classical" results known for set
functors: the first characterisation generalises the existence of a
distributive law over the genuine powerset monad, the second generalises
preservation of weak pullbacks. The results presented in this paper enable us
to compute predicate liftings of endofunctors of, for example, generalised
(ultra)metric spaces. We illustrate this by studying the coalgebraic cover
modality in this setting.Comment: 48 pages, accepted for publication in LMC
Counterpart semantics for a second-order mu-calculus
We propose a novel approach to the semantics of quantified Ό-calculi, considering models where states are algebras; the evolution relation is given by a counterpart relation (a family of partial homomorphisms), allowing for the creation, deletion, and merging of components; and formulas are interpreted over sets of state assignments (families of substitutions, associating formula variables to state components). Our proposal avoids the limitations of existing approaches, usually enforcing restrictions of the evolution relation: the resulting semantics is a streamlined and intuitively appealing one, yet it is general enough to cover most of the alternative proposals we are aware of
Completeness of Flat Coalgebraic Fixpoint Logics
Modal fixpoint logics traditionally play a central role in computer science,
in particular in artificial intelligence and concurrency. The mu-calculus and
its relatives are among the most expressive logics of this type. However,
popular fixpoint logics tend to trade expressivity for simplicity and
readability, and in fact often live within the single variable fragment of the
mu-calculus. The family of such flat fixpoint logics includes, e.g., LTL, CTL,
and the logic of common knowledge. Extending this notion to the generic
semantic framework of coalgebraic logic enables covering a wide range of logics
beyond the standard mu-calculus including, e.g., flat fragments of the graded
mu-calculus and the alternating-time mu-calculus (such as alternating-time
temporal logic ATL), as well as probabilistic and monotone fixpoint logics. We
give a generic proof of completeness of the Kozen-Park axiomatization for such
flat coalgebraic fixpoint logics.Comment: Short version appeared in Proc. 21st International Conference on
Concurrency Theory, CONCUR 2010, Vol. 6269 of Lecture Notes in Computer
Science, Springer, 2010, pp. 524-53
Goodwillie's Calculus of Functors and Higher Topos Theory
We develop an approach to Goodwillie's calculus of functors using the
techniques of higher topos theory. Central to our method is the introduction of
the notion of fiberwise orthogonality, a strengthening of ordinary
orthogonality which allows us to give a number of useful characterizations of
the class of -excisive maps. We use these results to show that the pushout
product of a -equivalence with a -equivalence is a
-equivalence. Then, building on our previous work, we prove a
Blakers-Massey type theorem for the Goodwillie tower. We show how to use the
resulting techniques to rederive some foundational theorems in the subject,
such as delooping of homogeneous functors.Comment: 40 pages, (a slightly modified version of) this paper is accepted for
publication by the Journal of Topolog
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
We establish a generic upper bound ExpTime for reasoning with global
assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier
results of this kind, our bound does not require a tractable set of tableau
rules for the instance logics, so that the result applies to wider classes of
logics. Examples are Presburger modal logic, which extends graded modal logic
with linear inequalities over numbers of successors, and probabilistic modal
logic with polynomial inequalities over probabilities. We establish the
theoretical upper bound using a type elimination algorithm. We also provide a
global caching algorithm that potentially avoids building the entire
exponential-sized space of candidate states, and thus offers a basis for
practical reasoning. This algorithm still involves frequent fixpoint
computations; we show how these can be handled efficiently in a concrete
algorithm modelled on Liu and Smolka's linear-time fixpoint algorithm. Finally,
we show that the upper complexity bound is preserved under adding nominals to
the logic, i.e. in coalgebraic hybrid logic.Comment: Extended version of conference paper in FCT 201
Many-valued coalgebraic logic over semi-primal varieties
We study many-valued coalgebraic logics with semi-primal algebras of
truth-degrees. We provide a systematic way to lift endofunctors defined on the
variety of Boolean algebras to endofunctors on the variety generated by a
semi-primal algebra. We show that this can be extended to a technique to lift
classical coalgebraic logics to many-valued ones, and that (one-step)
completeness and expressivity are preserved under this lifting. For specific
classes of endofunctors, we also describe how to obtain an axiomatization of
the lifted many-valued logic directly from an axiomatization of the original
classical one. In particular, we apply all of these techniques to classical
modal logic
A General Theory of Equivariant CNNs on Homogeneous Spaces
We present a general theory of Group equivariant Convolutional Neural
Networks (G-CNNs) on homogeneous spaces such as Euclidean space and the sphere.
Feature maps in these networks represent fields on a homogeneous base space,
and layers are equivariant maps between spaces of fields. The theory enables a
systematic classification of all existing G-CNNs in terms of their symmetry
group, base space, and field type. We also consider a fundamental question:
what is the most general kind of equivariant linear map between feature spaces
(fields) of given types? Following Mackey, we show that such maps correspond
one-to-one with convolutions using equivariant kernels, and characterize the
space of such kernels
Many-Valued Coalgebraic Logic: From Boolean Algebras to Primal Varieties
We study many-valued coalgebraic logics with primal algebras of truth-degrees. We describe a way to lift algebraic semantics of classical coalgebraic logics, given by an endofunctor on the variety of Boolean algebras, to this many-valued setting, and we show that many important properties of the original logic are inherited by its lifting. Then, we deal with the problem of obtaining a concrete axiomatic presentation of the variety of algebras for this lifted logic, given that we know one for the original one. We solve this problem for a class of presentations which behaves well with respect to a lattice structure on the algebra of truth-degrees
- âŠ