Related papers: Martin's conjecture, arithmetic equivalence, and c…

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

We prove that it is relatively consistent with $\mathrm{ZFC}$ that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel's conjecture fails). This answers a…

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…

It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

The paper provides the proof of the Rimann's conjecture. The results of the works of A. M. Odlyzko and H. te Riile "Disproof of the Conjecture", which gives a disproof of the Mertens hypothesis, using to prove the Riemann's hypothesis. This…

A fascinating conjectural connection between statistical mechanics and combinatorics has in the past five years led to the publication of a number of papers in various areas, including stochastic processes, solvable lattice models and…

The idea of using measure theoretic concepts to investigate the size of number theoretic sets, originating with E. Borel, has been used for nearly a century. It has led to the development of the theory of metrical Diophantine approximation,…

For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…

The uncountability of $\mathbb{R}$ is one of its most basic properties, known far outside of mathematics. Cantor's 1874 proof of the uncountability of $\mathbb{R}$ even appears in the very first paper on set theory, i.e. a historical…

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially…

In this paper we introduce the notion of $e$-computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

We show that it is consistent that the Borel Conjecture and the dual Borel Conjecture hold simultaneously.

We explore an application of homological algebra to set theoretic objects by developing a cohomology theory for Hausdorff gaps. The cohomology theory is introduced with enough generality to be applicable to other questions in set theory.…

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the…