Related papers: Generic Trace Logics
CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations…
This work is in a stream initiated by a paper of Killip and Simon [Ann. of Math. (2003)]. Using methods of Functional Analysis and the classical Szeg\"o Theorem we prove sum rule identities in a very general form. Then, we apply the result…
In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…
We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…
A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offers a (co)algebraic framework for studying processes with algebraic branching structures and recursion operators. The framework captures Milner's algebra of regular…
Following our joint work arXiv:1003.4578 with Robert Langlands, we make the first steps toward developing geometric methods for analyzing trace formulas in the case of the function field of a curve defined over a finite field. We also…
Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…
We study algebraic properties of Hopf group-coalgebras, recently introduced by Turaev. We show the existence of integrals and traces for such coalgebras, and we generalize the main properties of quasitriangular and ribbon Hopf algebras to…
We present some new results in theory of classical theta-functions of Jacobi and sigma-functions of Weierstrass: ordinary differential equations (dynamical systems) and series expansions. The paper is basically organized as a stream of new…
Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over…
The goal of this paper is to construct trace maps for the six functor formalism of motivic cohomology after Voevodsky, Ayoub, and Cisinski-D\'{e}glise. We also construct an $\infty$-enhancement of such a trace formalism. In the course of…
In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…
In a 1985 commentary to his collected works, Kolmogorov remarked that his 1932 paper "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic logic] will become a permanent part of a [standard] course of…
We show that intuitionistic propositional logic is \emph{Carnap categorical}: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds relative to the most…
We introduce the notion of vertex coalgebra, a generalization of vertex operator coalgebras. Next we investigate forms of cocommutativity, coassociativity, skew-symmetry, and an endomorphism, $D^*$, which hold on vertex coalgebras. The…
We will generalize Osburn's work about a congruence for traces defined in terms of Hauptmodul associated to certain genus zero groups of higher levels.
This paper introduces context algebras and demonstrates their application to combining logical and vector-based representations of meaning. Other approaches to this problem attempt to reproduce aspects of logical semantics within new…
We treat interpolation for various logics.
In this article we determine the implicational fragments of most of the known subintuitionistic logics.
We describe a general approach to deriving linear-time logics for a wide variety of state-based, quantitative systems, by modelling the latter as coalgebras whose type incorporates both branching and linear behaviour. Concretely, we define…