Related papers: The proof-theoretic strength of Constructive Secon…
Mekler's construction is a powerful technique for building purely algebraic structures from combinatorial ones. Its power lies in the fact that it allows various model-theoretic tameness properties of the combinatorial structure to transfer…
We present a new system S for handling uncertainty in a quantified modal logic (first-order modal logic). The system is based on both probability theory and proof theory. The system is derived from Chisholm's epistemology. We concretize…
This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the…
Quasi-topological gravities (QTGs) are higher-curvature extensions of Einstein gravity in $D\geq 5$ spacetime dimensions. Throughout the years, different notions of QTGs constructed from analytic functions of polynomial curvature invariants…
Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…
As a natural extension of the SAT problem, an array of proof systems for quantified Boolean formulas (QBF) have been proposed, many of which extend a propositional proof system to handle universal quantification. By formalising the…
We consider a quantified version of the (propositional) modal logic $\mathsf{BK}$, proposed earlier by S. P. Odintsov and H. Wansing; this version will be denoted by $\mathsf{QBK}$. Using the canonical model method, we prove the strong…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…
The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We study the structure of various invariants of the symmetric powers of a smooth projective curve in terms of that of the Jacobian of the curve. We generalise the results of Macdonald and Collino to various invariants including the…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…
In previous work, we defined and studied $\Sigma^*$-modules, a class of Hilbert $C^*$-modules over $\Sigma^*$-algebras (the latter are $C^*$-algebras that are sequentially closed in the weak operator topology). The present work continues…
Expanding the classic works of Kazhdan-Lusztig and Deodhar, we establish bar involutions and canonical (i.e., quasi-parabolic KL) bases on quasi-permutation modules over the type B Hecke algebra, where the bases are parameterized by cosets…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…