Related papers: Infinite Traces by Finality: a Sheaf-Theoretic App…
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…
The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…
While not obvious from its initial motivation in linear algebra, there are many context where iterated traces can be defined. In this paper we prove a very general theorem about iterated 2-categorical traces. We show that many…
This paper studies presentations of the Sierpinski gasket as a final coalgebra for functors on several categories of metric spaces with additional designated points. The three categories which we study differ on their morphisms: one uses…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Kurz et al. have recently shown that infinite $\lambda$-trees with finitely many free variables modulo $\alpha$-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of…
We show how a novel construction of the sheaf of Cherednik algebras on a quotient orbifold Y=X/G by virtue of formal geometry in author's prior work leads to results for the sheaf of Cherednik algebra which until recently were viewed as…
DEKL 2.0 is a dependent type-theoretic framework for trace-indexed knowledge evolution. Its central claim is that the proof calculus remains monotone under standard structural rules, while non-monotonic behavior arises semantically from…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…
In this paper we study stable finiteness of ample groupoid algebras with applications to inverse semigroup algebras and Leavitt path algebras, recovering old results and proving some new ones. In addition, we develop a theory of (faithful)…
Higher categorical structures are often defined by induction on dimension, which a priori produces only finite-dimensional structures. In this paper we show how to extend such definitions to infinite dimensions using the theory of terminal…
Despite its success in producing numerous general results on state-based dynamics, the theory of coalgebra has struggled to accommodate the Buechi acceptance condition---a basic notion in the theory of automata for infinite words or trees.…
A variant of the trace in a monoidal category is given in the setting of closed monoidal derivators, which is applicable to endomorphisms of fiberwise dualizable objects. Functoriality of this trace is established. As an application, an…
Continuation of algebraic structures in families of dynamical systems is described using category theory, sheaves, and lattice algebras. Well-known concepts in dynamics, such as attractors or invariant sets, are formulated as functors on…
In this survey, we first present basic facts on A-infinity algebras and modules including their use in describing triangulated categories. Then we describe the Quillen model approach to A-infinity structures following K. Lefevre's thesis.…
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,…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
We introduce the notion of a $c$-category, which is a kind of category whose behaviour is controlled by connective ring spectra. More precisely, any $c$-category admits a finite step resolution by categories of compact modules over…