Related papers: Effective categoricity of equivalence Structures
Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…
Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…
A description is an entity that can be interpreted as true or false of an object, and using feature structures as descriptions accrues several computational benefits. In this paper, I create an explicit interpretation of a typed feature…
A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…
We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…
A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
We describe all binary simple homogeneous structures M in terms of 0-definable equivalence relations on M, which "coordinatize" M and control dividing, and extension properties that respect these equivalence relations.
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
In recent years philosophers of science have explored categorical equivalence as a promising criterion for when two (physical) theories are equivalent. On the one hand, philosophers have presented several examples of theories whose…
It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…
We give a characterization of the sets of objects of the derived category of a block of a finite group algebra (or other symmetric algebra) that occur as the set of images of simple modules under an equivalence of derived categories. We…
It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…
For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
Racks and quandles are algebraic structures with a single binary operation that is right self-distributive and right invertible, and additionally idempotent in the case of quandles. The invertibility condition is equivalent to the existence…
We show how an effect algebra $\mathcal{X}$ can be regarded as a category, where the morphisms $x \rightarrow y$ are the elements $f$ such that $x \leq f \leq y$. This gives an embedding $\mathbf{EA} \rightarrow \mathbf{Cat}$. The interval…
We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…