逻辑
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…
We generalize previous results about stable domination and residue field domination to henselian valued fields of equicharacteristic 0 with bounded Galois group, and we provide an alternate characterization of stable domination in…
We define and study a higher-dimensional version of model theoretic internality, and relate it to higher-dimensional definable groupoids in the base theory.
Given a real closed field $R$, we identify exactly four proper reducts of $R$ which expand the underlying (unordered) $R$-vector space structure. Towards this theorem we introduce a new notion, of strongly bounded reducts of linearly…
This paper is motivated by the study of probability measure-preserving (pmp) actions of free groups using continuous model theory. Such an action is treated as a metric structure that consists of the measure algebra of the probability…
We prove a reconstruction theorem valid for arbitrary theories in continuous (or classical) logic in a countable language, that is to say that we provide a complete bi-interpretation invariant for such theories, taking the form of an open…
We study convolution semigroups of invariant/finitely satisfiable Keisler measures in NIP groups. We show that the ideal (Ellis) subgroups are always trivial and describe minimal left ideals in the definably amenable case, demonstrating…
Using an infinitary version of the Hypergraph Removal Lemma due to Towsner, we prove a model-theoretic higher amalgamation result. In particular, we obtain an independent amalgamation property which holds in structures which are measurable…
Using ideas from geometric stability theory we construct differentially closed fields with no non-trivial automorphisms.
We investigate computable metrizability of Polish spaces up to homeomorphism. In this paper we focus on Stone spaces. We use Stone duality to construct the first known example of a computable topological Polish space not homeomorphic to any…
Suppose that $K$ is an infinite field which is large (in the sense of Pop) and whose first order theory is simple. We show that $K$ is {\em bounded}, namely has only finitely many separable extensions of any given finite degree. We also…
This paper shows that in general, difference fields do not have a difference closure. However, we introduce a stronger notion of closure (kappa-closure), and show that every algebraically closed difference field K of characteristic 0, with…
A topological space is \emph{hereditarily $k$-irresolvable} if none of its subspaces can be partitioned into $k$ dense subsets, We use this notion to provide a topological semantics for a sequence of modal logics whose $n$-th member…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…
For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…