Related papers: Identities in modular arithmetic from reversible c…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
Human societies continuously transform scattered information into collective judgments and coordinated action, whether through markets discovering prices, governments allocating resources, communities enforcing norms, or science converging…
We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…
Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
In this work we study a kind of coherence condition on FI_G-modules, which generalizes the usual notion of finite generation. We prove that a module is coherent, in the appropriate sense, if and only if its generators, as well as its…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
The logical parallelism of propositional connectives and type constructors extends beyond the static realm of predicates, to the dynamic realm of processes. Understanding the logical parallelism of process propositions and dynamic types was…
Inverse categories are categories in which every morphism x has a unique pseudo-inverse y in the sense that xyx=x and yxy=y. Persistence modules from topological data analysis and similarly decomposable category representations factor…
Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introduce a modular framework for defining causal-consistent reversible extensions of concurrent models and languages. We show how our framework…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…
We study the primitive recursive analogue of computable categoricity spectra for various natural classes of structures. We show that these notions coincide for all relatively $\Delta_{2}^{0}$-categorical equivalence structures and linear…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
Let $R$ be a graded ring. We introduce a class of graded $R$-modules called Gr\"obner-coherent modules. Roughly, these are graded $R$-modules that are coherent as ungraded modules because they admit an adequate theory of Gr\"obner bases.…
We derive certain systems of differential equations for matrix elements of products and iterates of logarithmic intertwining operators among strongly graded generalized modules for a strongly graded conformal vertex algebra under suitable…