Related papers: Primitive recursive categoricity spectra
We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…
We define a notion of a connectivity structure on an $\infty$-category, analogous to a $t$-structure but applicable in unstable contexts -- such as spaces, or algebras over an operad. This allows us to generalize notions of n-skeleta,…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
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…
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…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural…
Generalized linear and additive models are very efficient regression tools but the selection of relevant terms becomes difficult if higher order interactions are needed. In contrast, tree-based methods also known as recursive partitioning…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
We explore a curious type of equivalence between certain pairs of reflective and coreflective subcategories. We illustrate with examples involving noncommutative duality for C*-dynamical systems and compact quantum groups, as well as…
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…
Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.
Let $\Delta$ be a finite set of nonzero linear forms in several variables with coefficients in a field $\mathbf K$ of characteristic zero. Consider the $\mathbf K$-algebra $C(\Delta)$ of rational functions generated by $\{1/\alpha \mid…
We describe a general framework for prime, completely prime, semiprime, and primitive ideals of an abelian 2-category. This provides a noncommutative version of Balmer's prime spectrum of a tensor triangulated category. These notions are…
We prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of…
This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper…
Generalizing homogeneous spectra for rings graded by natural numbers, we introduce multihomogeneous spectra for rings graded by abelian groups. Such homogeneous spectra have the same completeness properties as their classical counterparts,…
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…
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…