Related papers: B-systems
We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
Consider a monoidal category which is at the same time abelian with enough projectives and such that projectives are flat on the right. We show that there is a $B_{\infty}$-algebra which is $A_{\infty}$-quasi-isomorphic to the derived…
We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The…
Evaluation is a critical activity associated with any theory. Yet this has proven to be an exceptionally challenging activity for theories based on cognitive architectures. For an overlapping set of reasons, evaluation can also be…
In this note we record a comparison theorem on the B-model variation of semi-infinite Hodge structures. This result is considered a folklore theorem by experts in the field. We only take this opportunity to write it down. Our motivation is…
We recently introduced the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. There is a type of idempotent system, said to be symmetric. In the present paper we classify up…
Dynamical systems are a broad class of mathematical tools used to describe the evolution of physical and computational processes. Traditionally these processes model changing entities in a static world. Picture a ball rolling on an empty…
We introduce an algebraic analogue of dynamical systems, based on term rewriting. We show that a recursive function applied to the output of an iterated rewriting system defines a formal class of models into which all the main architectures…
The notion of semi-BCI algebras is introduced and some of its properties are investigated. This algebra is another generalization for BCI-algebras. It arises from the "intervalization" of BCI algebras. Semi-BCI have a similar structure to…
One important class of tools in the study of the connections between algebraic and topological structures are the "Banach-Stone type theorems", which describe algebraic isomorphisms of algebras (or groups, lattices, etc.) of functions in…
An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…
Let H be a quasi-Hopf algebra, a weak Hopf algebra or a braided Hopf algebra. Let B be an H-bicomodule algebra such that there exists a morphism of H-bicomodule algebras v:H\rightarrow B. Then we can define an object B^{co(H)} which is a…
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…
Whether explicit or implicit, sets are a critical part of many pieces of software. As a result, it is necessary to develop abstractions of sets for the purposes of abstract interpretation, model checking, and deductive verification.…
Hyperfields and systems are two algebraic frameworks which have been developed to provide a unified approach to classical and tropical structures. All hyperfields, and more generally hyperrings, can be represented by systems. Conversely, we…