Related papers: Covering the recursive sets
We apply minimal weakly generating sets to study the existence of Add$(U_R)$-covers for a uniserial module $U_R$. If $U_R$ is a uniserial right module over a ring $R$, then $S:=$End$ (U_R)$ has at most two maximal (right, left, two-sided)…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
A recent article of Chernikov, Hrushovski, Kruckman, Krupinski, Moconja, Pillay and Ramsey finds the first examples of simple structures with formulas which do not fork over $\emptyset$ but are universally measure zero. In this article we…
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…
Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes of countably infinite structures, that are…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
In work by Freedman [F2] and Freedman-Quinn [FQ] on the topology of 4-manifolds, null decompositions whose non-singleton elements are, in the terminology of [MOR], recursively starlike-equivalent sets of filtration length 1 arise and are…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
We construct examples of finite covers of punctured surfaces where the first rational homology is not spanned by lifts of simple closed curves. More generally, for any set $\mathcal{O} \subset F_n$ which is contained in the union of…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most…
In general a universal covering of a non connected topological group need not admit a topological group structure such that the covering map is a morphism of topological groups. This result is due to R.L. Taylor (1953). We generalise this…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
Recent work in computability theory has focused on various notions of asymptotic computability, which capture the idea of a set being "almost computable." One potentially upsetting result is that all four notions of asymptotic computability…
We give an example of two ordered structures M, N in the same language L with the same universe, the same order and admitting the same one-variable definable subsets such that M is a model of the common theory of o-minimal L-structures and…
Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…