Related papers: Primitive recursive categoricity spectra
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…
In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
We classify 0-dimensional spectral triples over complex and real algebras and provide some general statements about their differential structure. We investigate also whether such spectral triples admit a symmetry arising from the Hopf…
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…
Greenlees established an equivalence of categories between the homotopy category of rational SO(3)-spectra and the derived category DA(SO(3)) of a certain abelian category. In this paper we lift this equivalence of homotopy categories to…
Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.
We provide an explicit characterization of the properties of primitive recursive functions that are decidable or semi-decidable, given a primitive recursive index for the function. The result is much more general as it applies to any c.e.…
Categorical spectra are spectrum objects in pointed $(\infty,\infty)$-categories: sequences $(X_n)$ equipped with equivalences $X_n\simeq \Omega X_{n+1}$. This thesis develops foundations for categorical spectra and constructs their tensor…
In this paper we describe several characterizations of basic finite-dimensional $k$-algebras $A$ stratified for all linear orders, and classify their graded algebras as tensor algebras satisfying some extra property. We also discuss whether…
Distributive Stonean residuated lattices are closely related to Stone algebras since their bounded lattice reduct is a Stone algebra. In the present work we follow the ideas presented by Chen and Gr\"{a}tzer and try to apply them for the…
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…
This paper contains a classification of countable lower 1-transitive linear orders. The notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and is essential for the structure theory of 1-transitive trees.…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
We introduce the notion of a simultaneous categorical resolution of singularities, a categorical version of simultaneous resolutions of rational double points of surface degenerations. Furthermore, we suggest a construction of simultaneous…
We classify primitive, rank 1, omega-categorical structures having polynomially many types over finite sets. For a fixed number of 4-types, we show that there are only finitely many such structures and that all are built out of finitely…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Recollements of triangulated categories may be seen as exact sequences of such categories. Iterated recollements of triangulated categories are analogues of geometric or topological stratifications and of composition series of algebraic…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We define a class of finite-dimensional Jacobian algebras, which are called (simple) polygon-tree algebras, as a generalization of cluster-tilted algebras of type $\D$. They are $2$-CY-tilted algebras. Using a suitable process of mutations…