Related papers: Weihrauch goes Brouwerian
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…
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…
Finite versions of W-algebras are introduced by considering (symplectic) reductions of finite dimensional simple Lie algebras. In particular a finite analogue of $W^{(2)}_3$ is introduced and studied in detail. Its unitary and non-unitary,…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We classify Brauer graph algebras up to derived equivalence by showing that the set of derived invariants introduced by Antipov is complete. These algebras first appeared in representation theory of finite groups and can be defined for any…
We exhibit an adjunction between a category of abstract algebras of partial functions that we call difference-restriction algebras and a category of Hausdorff \'etale spaces. Difference-restriction algebras are those algebras isomorphic to…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
In this paper we study the notion of first-order part of a computational problem, first introduced by Dzhafarov, Solomon, and Yokoyama, which captures the "strongest computational problem with codomain $\mathbb{N}$ that is Weihrauch…
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…
A classic result of representation theory is Brauer's construction of a diagrammatical (geometrical) algebra whose matrix representation is a certain given matrix algebra, which is the commutating algebra of the enveloping algebra of the…
Motivated by a new conjecture on the behavior of bricks, we start a systematic study of minimal $\tau$-tilting infinite algebras. In particular, we treat minimal $\tau$-tilting infinite algebras as a modern counterpart of minimal…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
We describe the central measures for the random walk on graded graphs. Using this description, we obtain the list of all finite traces on three infinite-dimensional algebras: on the Brauer algebra, on the partition algebra, and on the…
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…
The variety of Brouwerian semilattices is amalgamable and locally finite, hence by well-known results due to W. H. Wheeler, it has a model completion (whose models are the existentially closed structures). In this paper, we supply for such…
Using Vakarelov's theory of lattice logics with negation, we introduce the (co)quasiintuitionistic logic, and prove its soundness and completeness with respect to the class of (co)quasiintuitionistic algebras. Combining these algebras…
For a complete lattice $L$ and a relational structure $\mathfrak{X}=(X,(R_i)_I)$, we introduce the convolution algebra $L^{\mathfrak{X}}$. This algebra consists of the lattice $L^X$ equipped with an additional $n_i$-ary operation $f_i$ for…
The authors of this article intend to present some results obtained in the study of biderivations of complete Lie algebras. Firstly they present a matricial approach to do this, which was a useful and explanatory tool not only in the study…
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…