Related papers: On completions, neat embeddings and omittings type…
In this paper, we construct a large class of new simple modules over the twisted $N=2$ superconformal algebra. These new simple modules are restricted modules based on the simple modules over certain finite-dimensional solvable Lie…
Using Popa's deformation/rigidity theory, we investigate prime decompositions of von Neumann algebras of the form $L(\mathcal{R})$ for countable probability measure preserving equivalence relations $\mathcal{R}$. We show that…
We introduce and begin to study Lie theoretical analogs of symplectic reflection algebras for a finite cyclic group, which we call "cyclic double affine Lie algebra". We focus on type A : in the finite (resp. affine, double affine) case, we…
In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…
Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…
Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…
Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic…
We prove a compactness theorem for full Boolean-valued models. As an application, we show that if $T$ is a complete countable theory and $\mathcal{B}$ is a complete Boolean algebra, then $\lambda^+$-saturated $\mathcal{B}$-valued models of…
We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…
We consider generalized $\Lambda$-structures on algebras and schemes over the ring of integers $\mathit{O}_K$ of a number field $K$. When $K=\mathbb{Q}$, these agree with the $\lambda$-ring structures of algebraic K-theory. We then study…
We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…
The goals of this article are as follows: (1) To determine the irreducible components of the affine varieties parametrizing the representations of $ \Lambda $ with dimension vector d, where $ \Lambda $ traces a major class of finite…
Killing forms on finite groups arise as examples of braided Killing forms on braided Lie algebras. For a finite group $G$ and a $G$-stable subset $\mathcal{C}$, the Killing form associated with $\mathbb{C}[\mathcal{C}]$ is given by…
Lie algebras are an important class of algebras which arise throughout mathematics and physics. We report on the formalisation of Lie algebras in Lean's Mathlib library. Although basic knowledge of Lie theory will benefit the reader, none…
Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…
We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded…
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…
Using the general method which was applied to prove finiteness of the set of hyperbolic generalized Cartan matrices of elliptic and parabolic type, we classify all symmetric (and twisted to symmetric) hyperbolic generalized Cartan matrices…