Related papers: On the Existence of Pushouts of Realizability Topo…
We explore classifiability of crossed products of actions of countable amenable groups on compact, metrizable spaces. It is completely understood when such crossed products are simple, separable, unital, nuclear and satisfy the UCT: these…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
In all $\kappa$-accessible additive categories, $\kappa$-pure monomorphisms and $\kappa$-pure epimorphisms are well-behaved, as shown in our previous paper arXiv:2311.02418. This is known to be not always true in $\kappa$-accessible…
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large" topological spaces. This framework has been applied to study the complexity of the differential operator and the…
We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…
We introduce a general method for showing under weak forcing axioms that reduced products of countable models of a theory $T$ have as few automorphisms as possible. We show that such forcing axioms imply that reduced products of countably…
Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…
We give simple characterizations of the category PAsm(A) of partitioned assemblies, and of the realizability topos RT(A) over a partial combinatory algebra A. This answers the question for an 'extensional characterization' of realizability…
Robust Principal Component Analysis (PCA) (Candes et al., 2011) and low-rank matrix completion (Recht et al., 2010) are extensions of PCA to allow for outliers and missing entries respectively. It is well-known that solving these problems…
In this note, we consider the space $H(\Omega)^{\mathbb N}$ of sequences of holomorphic functions on an open set $\Omega\subset {\mathbb C}$. If $H(\Omega)$ is endowed with its natural topology and $H(\Omega)^{\mathbb N}$ is endowed with…
Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of…
In this paper we raise the realisability problem in arrow categories. Namely, for a fixed category $\mathcal{C}$ and for arbitrary groups $H\le G_1\times G_2$, is there an object $\phi \colon A_1 \rightarrow A_2$ in…
We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…
Many ex/reg completions $J:\mathcal C\to\mathcal C_{\rm ex/reg}$ that arise in categorical realizability and tripos theory admit left Kan extensions of arbitrary finitely continuous functors to arbitrary exact categories. This paper…
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\Lambda} is tractable…
We reconcile the two different category-theoretic semantics of regular theories in predicate logic. A 2-category of `regular fibrations' is constructed, as well as a 2-category of `regular proarrow equipments', and it is shown that the two…
The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. These systems may be used to model higher-order programs and are closely related to the…
We study two categories of cellular automata. First, for any group $G$, we consider the category $\mathcal{CA}(G)$ whose objects are configuration spaces of the form $A^G$, where $A$ is a set, and whose morphisms are cellular automata of…
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow $\epsilon$-contractions and add a reachability predicate (with regular constraints) for pairs of configurations, the structures…