逻辑
Given a structure $M$ we introduce infinitary logic expansions, which generalise the Morleyisation. We show that these expansions are tame, in the sense that they preserve and reflect both the Embedding Ramsey Property (ERP) and the…
We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments.
We study contact posets and show that every contact poset can be embedded into a Boolean poset with overlap contact relation. Contact posets and (nonadditive) contact semilattices have the superamalgamation property, Fra\"\i ss\'e limits…
Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…
We study the definability of convex valuations on ordered fields, with a particular focus on the distinguished subclass of henselian valuations. In the setting of ordered fields, one can consider definability both in the language of rings…
We are interested in a class of groups, quasi-Frobenius groups (with involutions), whose internal structure generalizes that of the classical groups GA1(C), PGL 2(C) and SO3(R) : a subgroup and its conjugates, of finite index in their…
We investigate Keisler measures in arbitrary theories. Our initial focus is on Borel definability. We show that when working over countable parameter sets in countable theories, Borel definable measures are closed under Morley products and…
In this article, which is dedicated to my friend and colleague Boris Zilber on the occasion of his 75th birthday, I put forward a strategy for proving his quasiminimality conjecture for the complex exponential field. That is, for showing…
In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…
If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…
We apply domino problems to give short proofs for some known theorems for the classical predicate logic and to obtain lower bounds for complexity of modal predicate logics defined by Noetherian orders as Kripke frames.
We investigate the effect of adding $\omega_2$ Cohen reals on graphs on $\omega_2$, in particular we show that $\omega_2 \to (\omega_2, \omega : \omega)^2$ holds after forcing with $\mathsf{Add}(\omega, \omega_2)$ in a model of…
We show that unary log-analytic functions are polynomially bounded. In the higher dimensional case globally a log-analytic function can have exponential growth. We show that a log-analytic function is polynomially bounded on a definable set…
The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames. Precise complexity bounds for monadic logics of classes of Kripke frames with…
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…
Based on the well-known cardinal characteristics $\mathfrak{s}$, $\mathfrak{r}$ and $\mathfrak{i}$, we introduce nine related cardinal characteristics by using the notion of asymptotic density to characterise different intersection…
Continuing \cite{GitJir22}, we develop a version of Extender-based Magidor-Radin forcing where there are no extenders on the top ordinal. As an application, we provide another approach to obtain a failure of SCH on a club subset of an…
In this paper we study admissible extensions of several theories T of reverse mathematics. The idea is that in such an extension the structure M = (N,S,\in) of the natural numbers N and collection of sets of natural numbers S has to obey…
For any $n<\omega$ we construct an infinite Heyting algebra $H_n$ which is $(n+1)$-generated but that contains only finite $n$-generated subalgebras. From this we conclude that for every $n<\omega$ there exists a variety of Heyting algebras…
We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…