逻辑

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles \textit{``Strong Reducibilities''} (1981) and \textit{``Reducibilities''} (1999). The problem asks whether every computably…

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

We discuss an incompleteness result proven by Bezboruah and Shepherdson. This result tells us that the weak theory ${\sf PA}^-$ does not prove the consistency of any theory (under certain assumptions explained in the paper). Kreisel argued…

We generalize Goodstein's theorem (Goodstein 1944) and Cichon's independence proof (Cichon 1983) to $\Pi^1_1-\mathrm{CA}_0$ using results from (Wilken 2026). The method is generalizable to stronger notation systems that provide unique terms…

We consider the topological dynamics of the automorphism group of a particular sparse graph M_1 resulting from an ab initio Hrushovski construction. We show that minimal subflows of the flow of linear orders on M_1 have all orbits meagre,…

Let $T$ be a theory with a definable topology. $T$ is t-minimal in the sense of Mathews if every definable set in one variable has finite boundary. If $T$ is t-minimal, we show that there is a good dimension theory for definable sets,…

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary…

Odrzywo\l{}ek defined a system Exp-Minus-Log (EML) that reduces all elementary functions over complex numbers down to a constant `$1$', and a single two place function $E(\alpha, \beta) = \exp(\alpha) - \log(\beta)$. This paper shows that…

By recent work of \citet{DobrinenICM} and \citet{Balko7} we know that every finite $G$ in the Henson graph $\mathbb{H}_{n+1}$ (the universal ultrahomogeneous $(n+1)$-clique free graph) has exact finite big Ramsey degree $k({G,n})$. That is,…

This work uses mostly model-theoretic methods to establish new proof-theoretic theorems about several axiomatic theories of truth over KP (Kripke-Platek set theory) and stronger theories, especially ZF (Zermelo-Fraenkel set theory).

We give a categorical proof of the projectivity of $N$ in the free topos -- in proof-theoretic terms, the rule of countable choice for intuitionistic higher-order logic -- based on the unpublished proof of Michael Makkai (c.1980). The…

We study fragments of the existential theory of henselian valued fields with parameters. This includes the $\exists_n$-fragment in the equicharacteristic or unramified mixed characteristic case, the $\exists_n\exists_1$-fragment in the…

In this paper we provide an easy proof of Barmpalias--Lewis-Pye result saying that all computable increasing sequences converging to random reals converge with the same speed (up to a $c+o(1)$ factor) by noting that it immediately follows…

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

In this paper we examine two ways of coding sequences in arithmetical theories. We investigate under what conditions they work. To be more precise, we study the creation of objects of a data-type that we call ur-strings, roughly sequences…

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…

We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout…

We study an intuitionistic version of common knowledge logic (CK), called ICK, which was introduced by J\"ager and Marti. ICK extends intuitionistic propositional logic (IPL) by multiple box modalities interpreted as knowledge operators for…

We show that the VC-density in certain theories of oriented abelian groups is at most the size of parameter variables, which yields dp-minimality. We further prove that the VC-density of formulas in pairs of such models is bounded by twice…