Related papers: Completeness classes in algebraic complexity theor…
In this expository note, I present some of the key features of the lattice of torsion classes of a finite-dimensional algebra, focussing in particular on its complete semidistributivity and consequences thereof. This is intended to serve as…
In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…
The long lasting discussion on the completeness of quantum theory (QT) has not yet come to an end. The discussion is impeded by the lack of a clear understanding of what makes up the contents of a theory of physics in general and of QT…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…
A breakthrough took place in the von Neumann algebra theory when the Tomita-Takesaki theory was established around 1970. Since then, many important issues in the theory were developed through 1970's by Araki, Connes, Haagerup, Takesaki and…
This article is a transcription of a video of a 1972 lecture by Jean Dieudonn\'e, enhanced with composite still images from the video. The lecture covers the same material as an earlier paper and lecture notes by Dieudonn\'e, but the live…
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…
I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.
In this work, we introduce the concept of relative Lipschitz saturation, along with its key categorical and algebraic properties, and demonstrate how such a structure always gives rise to a radicial algebra.
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Leibniz algebras are certain generalization of Lie algebras. It is natural to generalize concepts in Lie algebras to Leibniz algebras and investigate whether the corresponding results still hold. In this paper we introduce the notion of…
Gradient plasticity theory proposed initially by Aifantis and co-workers has proven very useful in problems dealing with material heterogeneity and material instabilities. Although it has been used successfully in many applications by many…
The purpose of this note is to provide a gentle introduction to basic universal algebra and (abstract) clones.
This is a survey article on some recent developments in the arithmetic theory of linear algebraic groups over higher-dimensional fields, written for the Notices of the AMS.
These are the notes for a two-week mini-course given at a winter school in January 2014 as part of the thematic semester New Directions in Lie Theory at the Centre de Recherches Math\'ematiques in Montr\'eal. The goal of the course was to…
This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…