Related papers: Bqo is Pi^1_2-complete

We prove intuitionistic versions of the classical theorems saying that all countable closed subsets of $[-\pi,\pi]$ and even all countable subsets of $[-\pi,\pi]$ are sets of uniqueness.

A 1910 theorem of Brouwer characterizes the Cantor set as the unique totally disconnected, compact metric space without isolated points. A 1920 theorem of Sierpinski characterizes the rationals as the unique countable metric space without…

A dilator is a particularly uniform transformation $X\mapsto T_X$ of linear orders that preserves well-foundedness. We say that $X$ is a Bachmann-Howard fixed point of $T$ if there is an almost order preserving collapsing function…

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

We present the characterization of metric spaces that are micro-, macro- or bi-uniformly equivalent to the extended Cantor set $\{\sum_{i=-n}^\infty\frac{2x_i}{3^i}:n\in\IN ,\;(x_i)_{i\in\IZ}\in\{0,1\}^\IZ\}\subset\IR$, which is…

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

The study of well quasi-orders, wqo, is a cornerstone of combinatorics and within wqo theory Kruskal's theorem plays a crucial role. Extending previous proof-theoretic results, we calculate the $\Pi^1_1$ ordinals of two different versions…

We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient…

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…

We introduce a class of self-similar sets which we call {\em twofold Cantor sets} $K_{pq}$ in $\mathbb R$ which are totally disconnected, do not have weak separation property and at the same time have isomorphic self-similar structures.

We present an analogue of G\"{o}del's second incompleteness theorem for systems of second-order arithmetic. Whereas G\"{o}del showed that sufficiently strong theories that are $\Pi^0_1$-sound and $\Sigma^0_1$-definable do not prove their…

By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

We introduce the monoidal closed category qCPO of quantum cpos, whose objects are "quantized" analogs of omega-complete partial orders (cpos). The category qCPO is enriched over the category CPO of cpos, and contains both CPO, and the…

Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

In this note we provide a quasisymmetric taming of uniformly perfect and uniformly disconnected sets that generalizes a result of MacManus from 2 to higher dimensions. In particular, we show that a compact subset of $\mathbb{R}^n$ is…