Related papers: Regular Behaviours with Names
Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…
Given a global equivariant ultracommutative ring spectrum $E$ and inclusion $H\hookrightarrow G$ of finite groups, one may apply geometric fixed points to the norm $N_H^G E_H \to E_G$ to obtain what we call a \emph{geometric norm} $\Phi^H E…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
Let $R$ be a Noetherian ring, $I_1,\ldots,I_r$ be ideals of $R$, and $N\subseteq M$ be finitely generated $R$-modules. Let $S = \bigoplus_{\underline{n} \in \mathbb{N}^r} S_{\underline{n}}$ be a Noetherian standard $\mathbb{N}^r$-graded…
This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…
We show a first rectification result for homotopy chain coalgebras over a field. On the one hand, we consider the $\infty$-category obtained by localizing differential graded coalgebras over an operad with respect to quasi-isomorphisms; on…
Let $E$ and $F$ be Hilbert $C^*$-modules over a $C^*$-algebra $\CAlg{A}$. New classes of (possibly unbounded) operators $t:E\to F$ are introduced and investigated. Instead of the density of the domain $\Def(t)$ we only assume that $t$ is…
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to…
Let F be a right Hilbert C*-module over a C*-algebra B, and suppose that F is equipped with a left action, by compact operators, of a second C*-algebra A. Tensor product with F gives a functor from Hilbert C*-modules over A to Hilbert…
In this article, we study the behaviour of discrete one-dimensional dynamical systems associated to functions on finite sets. We formalise the global orbit pattern formed by all the periodic orbits (gop) as the ordered set of periods when…
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…
While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the…
When studying families in the moduli space of dynamical systems, choosing an appropriate representative function for a conjugacy class can be a delicate task. The most delicate questions surround rationality of the conjugacy class compared…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
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…