逻辑
We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…
In this paper we consider some fragments of $\mathsf{IOpen}$ (Robinson arithmetic $\mathsf Q$ with induction for quantifier-free formulas) proposed by Harvey Friedman and answer some questions he asked about these theories. We prove that…
This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries.…
We study the behaviour of forking in valued fields, and we give several sufficient conditions for parameter sets in a Henselian valued field of residue characteristic zero to be an extension base. Notably, we consider arbitrary (potentially…
In the context of generalized descriptive set theory, we systematically compare and analyze various notions of Polish-like spaces and standard $\kappa$-Borel spaces for $\kappa$ an uncountable (regular) cardinal satisfying $\kappa^{<\kappa}…
Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. It is shown that the former is the image of a surjective homomorphism from the latter,…
We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…
We produce a forcing extension of the constructible universe $\bL$ in which every universally measurable set of reals is $\uTDelta^{1}_{2}$, partially answering question CG from David Fremlin's problem list. The analogous result for…
We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…
We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…
Answering a question of D\v{z}amonja and Shelah, we show that every NSOP$_2$ theory is NSOP$_1$.
We study new relations of the following statements with weak choice principles in ZF and ZFA. 1. There does not exist an infinite Hausdorff space X such that every infinite subset of X contains an infinite compact subset. 2. If a field has…
This paper introduces the concept of a productive notion of big Ramsey degree and showcases its versatility through a handful of applications. The main focus is notably providing sufficient conditions for the existence of a finite canonical…
The syntactic nature of logic and computation separates them from other fields of mathematics. Nevertheless, syntax has been the only way to adequately capture the dynamics of proofs and programs such as cut-elimination, and the finiteness…
By an approximate subring of a ring we mean an additively symmetric subset $X$ such that $X\cdot X \cup (X +X)$ is covered by finitely many additive translates of $X$. We prove that each approximate subring $X$ of a ring has a locally…
This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…
We use the differentiability of the arithmetic volume function and an arithmetic Bertini type theorem to classify when one can find a closed point on the generic fiber of an arithmetic variety, whose heights with respect to some finite…
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
This is an extended abstract for a survey talk given in Oberwolfach on 1st December 2022, slightly updated in June 2023. I survey some work around the notion of quasiminimality and some of the progress towards Zilber's conjecture from the…