Related papers: Exhaustible sets in higher-type computation
We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…
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…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of…
The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…
Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…
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…
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…
The deck, $\mathcal{D}(X)$, of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}]\colon x \in X\}$, where $[Y]$ denotes the homeomorphism class of $Y$. A space $X$ is (topologically) reconstructible if whenever…
A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…
Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
This paper investigates the possibility of constructive extraction of measurable selector from set-valued maps which may commonly arise in viability theory, optimal control, discontinuous systems etc. For instance, existence of solutions to…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…
We show that the space of left-orderings of a countable virtually solvable group is either finite or homeomorphic to a Cantor set. We also provide an explicit description of the space of left-orderings of $SOL=\Z^2\rtimes_T\Z$.
In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…