Related papers: Pi01 encodability and omniscient reductions

The family of finite subsets $s$ of the natural numbers such that $|s|=1+\min s$ is known as the Schreier barrier in combinatorics and Banach Space theory, and as the family of exactly $\omega$-large sets in Logic. We formulate and prove…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complexity and the binary expansions of a very specific subset of…

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

We study coinductive invertibility of cells in weak $\omega$-categories. We use the inductive presentation of weak $\omega$-categories via an adjunction with the category of computads, and show that invertible cells are closed under all…

Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

Let $G$ be a group acting properly and essentially on an irreducible, non-Euclidean finite dimensional CAT(0) cube complex $X$ without fixed points at infinity. We show that for any finite collection of simultaneously inessential subgroups…

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

A subalgebra $\mathcal{A}$ of $\mathbb{M}_n(\mathbb{C})$ is said to be projection compressible if $P\mathcal{A}P$ is an algebra for all orthogonal projections $P\in\mathbb{M}_n(\mathbb{C})$. Likewise, $\mathcal{A}$ is said to be idempotent…

We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…

We prove that a $T_0$ topological space is $\omega$-well-filtered if and only if it does not admit either the natural numbers with the cofinite topology or with the Scott topology as its closed subsets in the strong topology. Based on this,…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Although Berkovich spaces may fail to be metrizable when defined over too big a field, we prove that a large part of their topology can be recovered through sequences: for instance, limit points of subsets are actual limits of sequences and…

Let k be a separably closed field. Let G be a reductive algebraic k-group. In this paper, we study Serre's notion of complete reducibility of subgroups of G over k. In particular, using the recently proved center conjecture of Tits, we show…