Related papers: Turing Incomparability in Scott Sets

The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $\tau$, and use them to give…

If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…

Let $k$ be an algebraically closed field of a prime characteristic $p$. Let $G$ be a finite group. We investigate the Brauer indecomposability of Scott $kG$-modules in relation to the kernel of modules. We generalize a criterion for Brauer…

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

Given a measure preserving transformation $T$ on a Lebesgue $\sigma$ algebra, a complete $T$ invariant sub $\sigma$ algebra is said to split if there is another complete $T$ invariant sub $\sigma$ algebra on which $T$ is Bernoulli which is…

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

We prove that for every Scott set $S$ there are $S$-saturated real closed fields and models of Presburger arithmetic.

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…

Every topological space has a Kolmogorov quotient that is obtained by identifying topologically indistinguishable points, that is, points that are contained in exactly the same open sets. In this survey, we look at the relationship between…

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the…

Let $X$ be a set, $B_{X}$ denotes the family of all subsets of $X$ and $F: X \longrightarrow B_{X}$ be a set-valued mapping such that $x \in F(x)$, $sup_{x\in X} | F(x)|< \kappa$, $sup_{x\in X} | F^{-1}(x)|< \kappa$ for all $x\in X$ and…

A data processing inequality states that the quantity of shared information between two entities (e.g. signals, strings) cannot be significantly increased when one of the entities is processed by certain kinds of transformations. In this…

We distinguish finitarily between algorithmic verifiability, and algorithmic computability, to show that Goedel's 'formally' unprovable, but 'numeral-wise' provable, arithmetical proposition [(Ax)R(x)] can be finitarily evidenced as:…

Separability is one of the most basic and important topological properties. In this paper, the separability in (strongly) topological gyrogroups is studied. It is proved that every first-countable left {\omega}-narrow strongly topological…