逻辑
We develop local forms of Ramsey-theoretic dichotomies for block sequences in infinite-dimensional vector spaces, analogous to Mathias' selective coideal form of Silver's theorem for analytic partitions of $[\mathbb{N}]^\infty$. Under large…
We consider various notions of equivalence in the space of bounded operators on a Hilbert space, in particular modulo finite rank, modulo Schatten $p$-class, and modulo compact. Using Hjorth's theory of turbulence, the latter two are shown…
Motivated by Kraji\v{c}ek and Scanlon's definition of the Grothendieck ring $K_0(M)$ of a first-order structure $M$, we introduce the definition of $K$-groups $K_n(M)$ for $n\geq0$ via Quillen's $S^{-1}S$ construction. We provide a recipe…
The $Reflection$ $Calculus$ ($\mathcal{\mathbf{RC}}$) is the fragment of the polymodal logic $\mathcal{\mathbf{GLP}}$ in the language $L^+$ whose formulas are built up from $\top$ and propositional variables using conjunction and diamond…
Answering a question of Dobrowolski, Kim and Ramsey, we find an $\mathrm{NSOP}_{1}$ theory that does not satisfy the existence axiom.
The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant…
We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…
Pseudo algebraically closed, pseudo real closed, and pseudo $p$-adically closed fields are examples of unstable fields that share many similarities, but have mostly been studied separately. In this text, we propose a unified framework for…
We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…
We explore the idea of using automatic and similar kind of presentations of structures to deal with the conceptual problem of natural proof-theoretic ordinal notations. We conclude that this approach still does not meet the goals.
Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…
For mass problems $P,Q\subseteq {\mathbb{N}^\mathbb{N}}$ (Baire space), $P$ is Medvedev reducible to $Q$ ($P\leq_sQ$) if for some Turing funcional $\Phi$, $\Phi(Q)\subseteq P$, and Medvedev equivalent to $Q$ if also $Q\leq_sP$. Shafer asked…
Generalised quantifiers, which include Henkin's branching quantifiers, have been introduced by Mostowski and Lindstr\"om and developed as a substantial topic application of logic, especially model theory, to linguistics with work by…
Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…
We formalize various counting principles and compare their strengths over $V^{0}$. In particular, we conjecture the following mutual independence between: (1) a uniform version of modular counting principles and the pigeonhole principle for…
We introduce a new invariant of Borel reducibility, namely the notion of thickness; this associates to every sentence $\Phi$ of $\mathcal{L}_{\omega_1 \omega}$ and to every cardinal $\lambda$, the thickness $\tau(\Phi, \lambda)$ of $\Phi$…
The article explores function terms within uniform theories. It examines the uniformity of these theories through an algebraic lens. The paper compares the uniformity of terms and predicates within axiom schemas. It demonstrates the…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
Given a reduced abelian $p$-group, we give an upper bound on the Scott complexity of the group in terms of its Ulm invariants. For limit ordinals, we show that this upper bound is tight. This gives an explicit sequence of such groups with…
We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…