相关论文: Turing Incomparability in Scott Sets

We prove that there does not exist a subset of the plane S that meets every isometric copy of the vertices of the unit square in exactly one point. We give a complete characterization of all three point subsets F of the reals such that…

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

In this note we give an example of a nonmeasurable set in the probability space for an infinite sequence of coin flips. The example arises naturally from the notion of an equivariant function, and serves as a pedagogical illustration of the…

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

We say that $S\subset\mathbb Z$ is a set of $k$-recurrence if for every measure preserving transformation $T$ of a probability measure space $(X,\mu)$ and every $A\subseteq X$ with $\mu(A)>0$, there is an $n\in S$ such that $\mu(A\cap…

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

We show that every connected set $X$ which is irreducible between two points $a$ and $b$ embeds into the Hilbert cube in a way that $X\cup \{c\}$ is irreducible between $a$ and $b$ for every point $c$ in the closure of $X$. Also, a…

An uncountable collection of arcs in S^3 is constructed, each member of which is wild precisely at its endpoints, such that the fundamental groups of their complements are non-trivial, pairwise non-isomorphic, and indecomposable with…

The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised…

We prove irreducibility and mutual inequivalence for certain unitary representations of R. Thompson's groups F and T.

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…

Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…

For a finite group $G$ denote by $N(G)$ the set of conjugesy class sizes of $G$. We show that every finite group $G$ with the property $N(G)=N(Alt_n), n>4$ or $N(G)=N(Sym_n), n>22$ is non-solvable.

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…