Related papers: Identities in modular arithmetic from reversible c…
A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform…
Coherence in a monoidal category asserts that all morphisms built from structural isomorphisms with a fixed source and target coincide. These structural isomorphisms include, in particular, the associators. Linearly distributive categories…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
The major concern in the study of categories of logics is to describe condition for preservation, under the a method of combination of logics, of meta-logical properties. Our complementary approach to this field is study the "global"…
Reversible computation is key in developing new, energy-efficient paradigms, but also in providing forward-only concepts with broader definitions and finer frames of study.Among other fields, the algebraic specification and representation…
Patterns are fundamental to human cognition, enabling the recognition of structure and regularity across diverse domains. In this work, we focus on structural repeats, patterns that arise from the repetition of hierarchical relations within…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
In [H5] (q-alg/9512024) and [H7] (q-alg/9704008), the author introduced the notion of intertwining operator algebra, a nonmeromorphic generalization of the notion of vertex operator algebra involving monodromies. The problem of constructing…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
Many insights into the quantum world can be found by studying it from amongst more general operational theories of physics. In this thesis, we develop an approach to the study of such theories purely in terms of the behaviour of their…
The Schur orthogonality relations are a cornerstone in the representation theory of groups. We utilize a generalization to weak Hopf algebras to provide a new, readily verifiable condition on the skeletal data for deciding whether a given…
We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…
We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using…
Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…