相关论文: Turing Incomparability in Scott Sets
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…
In this paper, I prove necessary and sufficient conditions for the existence of Turing instabilities in a general system with three interacting species. Turing instabilities describe situations when a stable steady state of a reaction…
We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.
We prove that any finite set $F\subset {\mathbb{Z}^2}$ that tiles ${\mathbb{Z}^2}$ by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set $F$ tiles ${\mathbb{Z}^2}$ is decidable.
Given a Mumford curve $X$ over $\bar{\mathbb Q_p}$, we show that for every semistable model $\mathcal X$ of $X$ and every closed point $x$ of this semistable model, there exists a finite \'etale cover $Y$ of $X$ such that every semistable…
A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…
Through the $\eta$-inner product, we investigate $\cal PT$-symmetric quantum mechanics from the viewpoint of superposition and coherence theory. It is argued that $\cal PT$-symmetric quantum systems are endowed with stationary superposition…
In the context of a physical theory, two devices, A and B, described by the theory are called incompatible if the theory does not allow the existence of a third device C that would have both A and B as its components. Incompatibility is a…
Let f be an entire function with a bounded set of singular values, and suppose furthermore that the postsingular set of f is bounded. We show that every component of the escaping set I(f) is unbounded. This provides a partial answer to a…
In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…
We construct a Borel graph G such that ZF+DC+"There are no maximal independent sets in G" is equiconsistent with ZFC+"There exists an inaccessible cardinal".
The Isbell, compact-open and point-open topologies on the set $C(X,\mathbb{R})$ of continuous real-valued maps can be represented as the dual topologies with respect to some collections $\alpha(X)$ of compact families of open subsets of a…
The Church-Turing Thesis confuses numerical computations with symbolic computations. In particular, any model of computability in which equality is not definable, such as the lambda-models underpinning higher-order programming languages, is…
It is consistent with ZF set theory that the Euclidean topology on the real line is not sequential, yet every infinite set of reals contains a countably infinite subset. This answers a question of Gutierres.
Simple argument in favour of unitarity, to all orders, of space-like noncommutative theory is given.
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling…
We consider precompact sequential and Fr\'echet group topologies and show that some natural constructions of such topologies always result in metrizable groups answering a question of D.~Dikranjan et al. We show that it is consistent that…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…