逻辑

The Filter Extension Principle (FEP) asserts that every filter can be extended to an ultrafilter, which plays a crucial role in the quest for non-principal ultrafilters. Non-principal ultrafilters find widespread applications in logic, set…

We construct a formal theory, which we call reflectica, whose language possesses the following properties of natural language: it is a self-reflecting language and an intensional language. By a self-reflecting language we understand an…

Hamkins and L\"{o}we asked whether there can be a model $N$ of set theory with the property that $N\equiv N[g]$ whenever $g$ is a generic collapse of a cardinal of $N$ onto $\omega$. We give equiconsistency results for two weaker versions…

We look at simple groups associated primarily with the general theory of Moufang buildings, and to analyze their relation to stability theory in the model theoretic sense. As it becomes quite technical in the details, a lengthy introduction…

We share both recent and older, well-known results regarding the notions of stable ordinals and shrewd cardinals. We then argue that $\Sigma_2$-nonprojectible ordinals may be considered as recursive analogues to subtle cardinals, a highly…

We study the complexity of the computational task ``Given a colouring $c : \mathbb{Q} \to \mathbf{k}$, find a monochromatic $S \subseteq \mathbb{Q}$ such that $(S,<) \cong (\mathbb{Q},<)$''. The framework is Weihrauch reducibility. Our…

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

As consequence of the VC theorem, any pseudo-finite measure over an NIP ultraproduct is generically stable. We demonstrate a converse of this theorem and prove that any finitely approximable measure over an ultraproduct is itself…

Conway's real closed field $\mathbf{No}$ of surreal numbers is a sweeping generalization of the real numbers and the ordinals to which a number of elementary functions such as log and exponentiation have been shown to extend. The problems…

We both survey and extend a new technique from Lu Liu to prove separation theorems between products of Ramsey-type theorems over computable reducibility. We use this technique to show that Ramsey's theorem for $n$-tuples and three colors is…

In this paper, we study the construction methods for uninorms on bounded lattices via functions with the given uninorms and $q\in \mathbb{L_{B}}$ (or $p\in \mathbb{L_{B}}$). Specifically, we investigate the conditions under which these…

The following question was asked by Grigorieff: Suppose $V$ is a ZFC model and $V[G]$ is a set-generic extension of $V$. Can there be a ZF model $N$ so that $V\subset N \subset V[G]$ yet $N$ is not equal to $V(A)$ for any set $A\in V[G]$?…

For exponentially closed ordinals $\alpha$, we consider recognizability of constructible subsets of $\alpha$ for $\alpha$-(w)ITRMs and their distribution in the constructible hierarchy. In particular, for $\alpha$-ITRMs, we show that, there…

We introduce a class of theories called metastable, including the theory of algebraically closed valued fields (ACVF) as a motivating example. The key local notion is that of definable types dominated by their stable part. A theory is…

The infinite pigeonhole principle for $k$ colors ($\mathsf{RT}_k$) states, for every $k$-partition $A_0 \sqcup \dots \sqcup A_{k-1} = \mathbb{N}$, the existence of an infinite subset~$H \subseteq A_i$ for some~$i < k$. This seemingly…

A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p\to q)\vee (q\to p)$ iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called bi-G\"odel…

We show that a real analytic restricted log-exp-analytic function has a holomorphic extension which is again restricted log-exp-analytic. We also establish a parametric version of this result.

Not all logical systems can be captured using algebras. We see this in classical logic (formalized by Boolean algebras) and many-valued logics (like Lukasiewicz logic with MV-algebras). Even quantum mechanics, initially formalized with…

Let $G$ be a unipotent group and $\mathcal F=\{F_t:t\in (0,\infty)\}$ a family of subsets of $G$, with $\mathcal F$ definable in an o-minimal expansion of the real field. Given a lattice $\Gamma\subseteq G$, we study the possible Hausdorff…

Stable infiniteness, strong finite witnessability, and smoothness are model-theoretic properties relevant to theory combination in satisfiability modulo theories. Theories that are strongly finitely witnessable and smooth are called…