逻辑
The Solecki dichotomy in descriptive set theory and the Posner-Robinson theorem in computability theory bear a superficial resemblance to each other and can sometimes be used to prove the same results, but do not have any obvious direct…
Assuming $V=L$, we construct a plane set $E$ of Hausdorff dimension $1$ whose every orthogonal projection onto straight lines through the origin has Hausdorff dimension $0$. This is a counterexample to J. M. Marstrand's seminal projection…
The class of all countable differentially closed differential fields $K$ of characteristic $0$ was shown by Marker and the author to be "one jump away" from universal for spectra of structures: for every nontrivial countable structure…
We axiomatize a class of existentially closed exponential fields equipped with an $E$-derivation. We apply our results to the field of real numbers endowed with $exp(x)$ the classical exponential function defined by its power series…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We analyze Euclidean spheres in higher dimensions and the corresponding orbit equivalence relations induced by the group of rational rotations from the viewpoint of descriptive set theory. It turns out that such equivalence relations are…
We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation…
We provide sharp cylindrical parametrizations of cylindrical cell decompositions by maps with bounded $C^{r}$ norm in the sharply o-minimal setting, thus generalizing and strengthening the Yomdin-Gromov Algebraic Lemma. We introduce forts,…
The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…
In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of {\Pi} 2 cuts (a recursive proof encapsulating the infinitary pigeonhole principle) [5]. However the derived…
Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…
We discuss why Type Theory is preferable as foundation of Mathematics compared to set theory.
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
We identify a choiceless variation of the box game paradox, in which players predict unknown real numbers with near-perfect accuracy despite lacking any useful information. We also verify that choice is necessary in the solution of the…
This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^\omega \omega}$ to ${^\omega \omega}$ is analyzed. In that paper, for each $a \in {^\omega \omega}$ we defined a…
It is well-known that intuitionistic logics can be formalized by means of Brouwerian semilattices, i.e. relatively pseudocomplemented semilattices. Then the logical connective implication is considered to be the relative pseudocomplement…
We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…
We force the existence of a non-trivial $\kappa$-complete ultrafilter over $\kappa$ which fails to satisfy the Galvin property. This answers a question asked by the first author and Moti Gitik.
Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…
Robin Hirsch posed in 1996 the 'Really Big Complexity Problem': classify the computational complexity of the network satisfaction problem for all finite relation algebras A. We provide a complete classification for the case that A is…