Related papers: A New Foundation for Finitary Corecursion and Iter…
We show a universal algebraic local characterisation of the expressive power of finite-valued languages with domains of arbitrary cardinality and containing arbitrary many cost functions.
We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…
Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…
We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…
Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructions (AIC) -- a purely algebraic approach to reasoning about…
We study non-counital coalgebras and their dual non-unital algebras, and introduce the finite dual of a non-unital algebra. We show that a theory that parallels in good part the duality in the unital case can be constructed. Using this, we…
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…
A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…
The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number, possibly infinite, $\varphi_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…
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…
We describe and implement a symbolic algebra for scalar and vector-valued finite elements, enabling the computer generation of elements with tensor product structure on quadrilateral, hexahedral and triangular prismatic cells. The algebra…
An old theorem of Ad\'amek constructs initial algebras for sufficiently cocontinuous endofunctors via transfinite iteration over ordinals in classical set theory. We prove a new version that works in constructive logic, using "inflationary"…
We implement a spatially fixed mesh refinement under spherical symmetry for the characteristic formulation of General Relativity. The Courant-Friedrich-Levy (CFL) condition lets us deploy an adaptive resolution in (retarded-like) time, even…
We establish axiomatic characterizations of $K$-theory and $KK$-theory for real C*-algebras. In particular, let $F$ be an abelian group-valued functor on separable real C*-algebras. We prove that if $F$ is homotopy invariant, stable, and…
This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…
The aim of this paper is to extend the definition of motivic homotopy theory from schemes to a large class of algebraic stacks and establish a six functor formalism. The class of algebraic stacks that we consider includes many interesting…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
A further significant extension is presented of the infinitely large class of differential algebras of generalized functions which are the basic structures in the nonlinear algebraic theory listed under 46F30 in the AMS Mathematical Subject…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…